Omitting types for finite variable fragments and complete representations of algebras

2008 ◽  
Vol 73 (1) ◽  
pp. 65-89 ◽  
Author(s):  
Hajnal Andréka ◽  
István Németi ◽  
Tarek Sayed Ahmed

AbstractWe give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimension n (for finite n > 2) with the additional property that they are one-generated and the set of all n by n atomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first order logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic.

Author(s):  
Tarek Sayed Ahmed

Fix \(2 < n < \omega\). Let \(L_n\) denote first order logic restricted to the first $n$ variables. Using the machinery of algebraic logic, positive and negative results on omitting types are obtained for \(L_n\) and for infinitary variants and extensions of \(L_{\omega, \omega}\).


2002 ◽  
Vol 8 (3) ◽  
pp. 348-379 ◽  
Author(s):  
Robin Hirsch ◽  
Ian Hodkinson ◽  
Roger D. Maddux

AbstractFor every finite n ≥ 4 there is a logically valid sentence φn with the following properties: φn contains only 3 variables (each of which occurs many times); φn contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); φn has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n − 1 variables. This result was first proved using the machinery of algebraic logic developed in several research monographs and papers. Here we replicate the result and its proof entirely within the realm of (elementary) first-order binary predicate logic with equality. We need the usual syntax, axioms, and rules of inference to show that φn has a proof with only n variables. To show that φn has no proof with only n − 1 variables we use alternative semantics in place of the usual, standard, set-theoretical semantics of first-order logic.


1985 ◽  
Vol 50 (4) ◽  
pp. 865-873
Author(s):  
H. Andréka ◽  
I. Németi

The theory of cylindric algebras (CA's) is the algebraic theory of first order logics. Several ideas about logic are easier to formulate in the frame of CA-theory. Such are e.g. some concepts of abstract model theory (cf. [1] and [10]–[12]) as well as ideas about relationships between several axiomatic theories of different similarity types (cf. [4] and [10]). In contrast with the relationship between Boolean algebras and classical propositional logic, CA's correspond not only to classical first order logic but also to several other ones. Hence CA-theoretic results contain more information than their counterparts in first order logic. For more about this see [1], [3], [5], [9], [10] and [12].Here we shall use the notation and concepts of the monographs Henkin-Monk-Tarski [7] and [8]. ω denotes the set of natural numbers. CAα denotes the class of all cylindric algebras of dimension α; by “a CAα” we shall understand an element of the class CAα. The class Dcα ⊆ CAα was defined in [7]. Note that Dcα = 0 for α ∈ ω. The classes Wsα, and Csα were defined in 1.1.1 of [8], p. 4. They are called the classes of all weak cylindric set algebras, regular cylindric set algebras and cylindric set algebras respectively. It is proved in [8] (I.7.13, I.1.9) that ⊆ CAα. (These inclusions are proper by 7.3.7, 1.4.3 and 1.5.3 of [8].)It was proved in 2.3.22 and 2.3.23 of [7] that every simple, finitely generated Dcα is generated by a single element. This is the algebraic counterpart of a property of first order logics (cf. 2.3.23 of [7]). The question arose: for which simple CAα's does “finitely generated” imply “generated by a single element” (see p. 291 and Problem 2.3 in [7]). In terms of abstract model theory this amounts to asking the question: For which logics does the property described in 2.3.23 of [7] hold? This property is roughly the following. In any maximal theory any finite set of concepts is definable in terms of a single concept. The connection with CA-theory is that maximal theories correspond to simple CA's (the elements of which are the concepts of the original logic) and definability corresponds to generation.


2002 ◽  
Vol 67 (1) ◽  
pp. 197-213 ◽  
Author(s):  
Robin Hirsch ◽  
Ian Hodkinson ◽  
Roger D. Maddux

AbstractWe confirm a conjecture, about neat embeddings of cylindric algebras, made in 1969 by J. D. Monk, and a later conjecture by Maddux about relation algebras obtained from cylindric algebras. These results in algebraic logic have the following consequence for predicate logic: for every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language ℒ with equality and exactly one nonlogical binary relation symbol E, such that X contains only 3 variables (each of which may occur arbitrarily many times), X has a proof containing exactly α + 1 variables, but X has no proof containing only α variables. This solves a problem posed by Tarski and Givant in 1987.


Author(s):  
Gregory H. Moore

The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic logic or mathematical logic – makes essential use of artificial symbolic languages. Since Aristotle, logic has been a part of philosophy. Around 1850 the mathematician Boole began the modern development of symbolic logic. During the twentieth century, logic continued in philosophy departments, but it began to be seriously investigated and taught in mathematics departments as well. The most important examples of the latter were, from 1905 on, Hilbert at Göttingen and then, during the 1920s, Church at Princeton. As the twentieth century began, there were several distinct logical traditions. Besides Aristotelian logic, there was an active tradition in algebraic logic initiated by Boole in the UK and continued by C.S. Peirce in the USA and Schröder in Germany. In Italy, Peano began in the Boolean tradition, but soon aimed higher: to express all major mathematical theorems in his symbolic logic. Finally, from 1879 to 1903, Frege consciously deviated from the Boolean tradition by creating a logic strong enough to construct the natural and real numbers. The Boole–Schröder tradition culminated in the work of Löwenheim (1915) and Skolem (1920) on the existence of a countable model for any first-order axiom system having a model. Meanwhile, in 1900, Russell was strongly influenced by Peano’s logical symbolism. Russell used this as the basis for his own logic of relations, which led to his logicism: pure mathematics is a part of logic. But his discovery of Russell’s paradox in 1901 required him to build a new basis for logic. This culminated in his masterwork, Principia Mathematica, written with Whitehead, which offered the theory of types as a solution. Hilbert came to logic from geometry, where models were used to prove consistency and independence results. He brought a strong concern with the axiomatic method and a rejection of the metaphysical goal of determining what numbers ‘really’ are. In his view, any objects that satisfied the axioms for numbers were numbers. He rejected the genetic method, favoured by Frege and Russell, which emphasized constructing numbers rather than giving axioms for them. In his 1917 lectures Hilbert was the first to introduce first-order logic as an explicit subsystem of all of logic (which, for him, was the theory of types) without the infinitely long formulas found in Löwenheim. In 1923 Skolem, directly influenced by Löwenheim, also abandoned those formulas, and argued that first-order logic is all of logic. Influenced by Hilbert and Ackermann (1928), Gödel proved the completeness theorem for first-order logic (1929) as well as incompleteness theorems for arithmetic in first-order and higher-order logics (1931). These results were the true beginning of modern logic.


1984 ◽  
Vol 49 (1) ◽  
pp. 241-256
Author(s):  
Matt Kaufmann

AbstractLogics LF(M) are considered, in which M (“most”) is a new first-order quantifier whose interpretation depends on a given filter F of subsets of ω. It is proved that countable compactness and axiomatizability are each equivalent to the assertion that F is not of the form {(⋂F) ∪ X: ∣ω − X∣ < ω} with ∣ω − ⋂F∣ = ω. Moreover the set of validities of LF (M) and even of depends only on a few basic properties of F. Similar characterizations are given of the class of filters F for which LF (M) has the interpolation or Robinson properties. An omitting types theorem is also proved. These results sharpen the corresponding known theorems on weak models (, where the collection q is allowed to vary. In addition they provide extensions of first-order logic which possess some nice properties, thus escaping from contradicting Lindström's Theorem [1969] only because satisfaction is not isomorphism-invariant (as it is tied to the filter F). However, Lindström's argument is applied to characterize the invariant sentences as just those of first-order logic.


2006 ◽  
Vol 71 (1) ◽  
pp. 104-118 ◽  
Author(s):  
Gábor Sági ◽  
Saharon Shelah

AbstractWe show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a strong form of this theorem does not hold. Translating these results into Algebraic Logic we obtain a finitely axiomatizable subvariety of finite dimensional Representable Cylindric Algebras that has the Strong Amalgamation Property but does not have the Superamalgamation Property. This settles a conjecture of Pigozzi [12].


Sign in / Sign up

Export Citation Format

Share Document