Studia Logica 60 (3):343-355 (1998)
Many results concerning the equivalence between a syntactic form of formulas and a model theoretic conditions are proven directly without using any form of a continuum hypothesis. In particular, it is demonstrated that any reduced product sentence is equivalent to a Horn sentence. Moreover, in any first order language without equality one now has that a reduced product sentence is equivalent to a Horn sentence and any sentence is equivalent to a Boolean combination of Horn sentences.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Semantics for Deflationists.Christopher Gauker - 2005 - In J. C. Beall & Bradley Armour-Garb (eds.), Deflationism and Paradox. Oxford University Press.
Taxonomies of Model-Theoretically Defined Topological Properties.Paul Bankston - 1990 - Journal of Symbolic Logic 55 (2):589-603.
An Algorithm to Determine, for Any Prime P, a Polynomial-Sized Horn Sentence Which Expresses "the Cardinality is Not P".Sauro Tulipani - 1985 - Journal of Symbolic Logic 50 (4):1062-1064.
Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
Safe Formulas in the General Theory of Stable Models (Preliminary Report).Vladimir Lifschitz - unknown
Early History of the Generalized Continuum Hypothesis: 1878—1938.Gregory H. Moore - 2011 - Bulletin of Symbolic Logic 17 (4):489-532.
Added to index2009-01-28
Total downloads8 ( #493,588 of 2,172,844 )
Recent downloads (6 months)1 ( #324,901 of 2,172,844 )
How can I increase my downloads?