• Aucun résultat trouvé

LOGICS Some first-order theories

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "LOGICS Some first-order theories"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Bordeaux university

Master Computer Science, 2015/2016

LOGICS

Some first-order theories

EG (Equality theory) REF : ∀ x x = x

SYM : ∀ x, y (x = y → y = x)

TRANS : ∀ x, y, z (x = y ∧ y = z) → x = z) COMPF : ∀ ~ x, ~ y (~ x = ~ y → f (~ x) = f (~ y)) COMPR : ∀ ~ x, ~ y (~ x = ~ y → R(~ x) → R(~ y))

P0 (Elementary arithmetics) All the axioms from EG ; A1 : ∀ x ¬ S(x) = 0

A2 : ∀ x (x = 0 ∨ ∃ y, x = S(y) A3 : ∀ x, y (S(x) = S(y) → x = y) A4 : ∀ x (x + 0 = x)

A5 : ∀ x, y (x + S(y) = S(x + y)) A6 : ∀ x (x × 0 = 0)

A7 : ∀ x, y (x × S(y) = x × y + x)

PA (Peano arithmetics) All the axioms from P

0

;

REC

Φ

: (Φ(0) ∧ ( ∀ x(Φ(x) → Φ(S(x)))) → ∀ xΦ(x) for every formula Φ(x) ;

MO (Monoıd theory) All the axioms from EG ;

ASS : ∀ x, y, z x ∗ (y ∗ z) = (x ∗ y) ∗ z NE : ∀ x (x ∗ e = x ∧ e ∗ x = x)

GR (Group theory) All the axioms from M O ;

INV : ∀ x (x ∗ I(x) = e ∧ I (x) ∗ x = e)

Références

Télécharger maintenant ( PDF - 1 Page - 23.65 KB )

Documents relatifs

LOGICS, J1IN7M12 Test on 16/10/2014. Some solutions.

Formula Φ means that every natural integer is a product of four even numbers.. But the integer 1 is not divisible by 16, hence is not decomposable as such

LOGICS, J1IN7M21 Examination on 15/12/2014. Some solutions.

a double-exponential function of the size of the

Effect of order parameter fluctuations on the Halperin-Lubensky-Ma first-order transition in superconductors and liquid crystals

The analysis of HLM initially centered on the fluctuations of the gauge field and neglected the OP fluctuations, which is justifiable for good type-I superconductors (with

Towards Typed Higher-Order Description Logics

In this paper, we investigate the extension of description logics (DLs) up to SROIQ with typed higher-order concepts and roles, having in mind the particular application to

Learning Probabilistic Description Logics Theories

We overview two systems we hve implemented: EDGE, that returns the value of the probabilities associated with axioms tuned using an Expectation Maximization algorithm, and LEAP,

Implication and biconditional in some three-valued logics

The interpretation for connectives → and ↔ in many-valued logics is not stan- dard and it is important to study them since they are the relevant connectives in order to define

Relating some Logics for True Concurrency

The logic has formulae that predicate over executability of events in computati- ons and their dependency relations (causality, concurrency), and provide second order power

Pure first-order logics of quasiary predicates

Описано семантичні моделі та мови таких логік, особливу увагу приділено вивченню композиційних предикатних алгебр та класів інтер- претацій