first order definability
Recently Published Documents


TOTAL DOCUMENTS

24
(FIVE YEARS 1)

H-INDEX

6
(FIVE YEARS 0)

2021 ◽  
Vol 1901 (1) ◽  
pp. 012032
Author(s):  
Ivan M. Buchinskiy ◽  
Alexander V. Treier


2020 ◽  
Vol 57 (3) ◽  
pp. 321-371
Author(s):  
Tarek Sayed Ahmed

AbstractFix 2 < n < ω and let CAn denote the class of cyindric algebras of dimension n. Roughly CAn is the algebraic counterpart of the proof theory of first order logic restricted to the first n variables which we denote by Ln. The variety RCAn of representable CAns reflects algebraically the semantics of Ln. Members of RCAn are concrete algebras consisting of genuine n-ary relations, with set theoretic operations induced by the nature of relations, such as projections referred to as cylindrifications. Although CAn has a finite equational axiomatization, RCAn is not finitely axiomatizable, and it generally exhibits wild, often unpredictable and unruly behavior. This makes the theory of CAn substantially richer than that of Boolean algebras, just as much as Lω,ω is richer than propositional logic. We show using a so-called blow up and blur construction that several varieties (in fact infinitely many) containing and including the variety RCAn are not atom-canonical. A variety V of Boolean algebras with operators is atom canonical, if whenever 𝔄 is atomic, then its Dedekind-MacNeille completion, sometimes referred to as its minimal completion, is also in V. From our hitherto obtained algebraic results we show, employing the powerful machinery of algebraic logic, that the celebrated Henkin-Orey omitting types theorem, which is one of the classical first (historically) cornerstones of model theory of Lω,ω, fails dramatically for Ln even if we allow certain generalized models that are only locallly clasfsical. It is also shown that any class K such that , where CRCAn is the class of completely representable CAns, and Sc denotes the operation of forming dense (complete) subalgebras, is not elementary. Finally, we show that any class K such that is not elementary, where Sd denotes the operation of forming dense subalgebra.





2018 ◽  
Vol 28 (3) ◽  
pp. 459-488 ◽  
Author(s):  
Antje Rumberg ◽  
Alberto Zanardo




2013 ◽  
Vol 6 (2) ◽  
pp. 229-253 ◽  
Author(s):  
TOMOYUKI SUZUKI

AbstractIn this paper, we establish the first-order definability of sequents with consistent variable occurrence on bi-approximation semantics by means of the Sahlqvist–van Benthem algorithm. Then together with the canonicity results in Suzuki (2011), this allows us to establish a Sahlqvist theorem for substructural logic. Our result is not limited to substructural logic but is also easily applicable to other lattice-based logics.



2011 ◽  
Vol 175 (3-4) ◽  
pp. 890-913 ◽  
Author(s):  
Yin Chen ◽  
Fangzhen Lin ◽  
Yan Zhang ◽  
Yi Zhou


2010 ◽  
Vol 14 (48) ◽  
Author(s):  
José Raymundo Marcial Romero ◽  
José Antonio Hernández


2009 ◽  
Vol 74 (4) ◽  
pp. 1206-1210
Author(s):  
Arno Fehm ◽  
Wulf-Dieter Geyer

AbstractThe work [11] deals with questions of first-order definability in algebraic function fields. In particular, it exhibits new cases in which the field of constant functions is definable, and it investigates the phenomenon of definable transcendental elements. We fix some of its proofs and make additional observations concerning definable closure in these fields.



Sign in / Sign up

Export Citation Format

Share Document