Studia Logica 60 (3):343-355 (1998)
|Abstract||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||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Christopher Gauker (2005). Semantics for Deflationists. In JC Beall & Bradley Armour-Garb (eds.), Deflationism and Paradox. Oxford University Press.
Holger Sturm (2000). Modal Horn Classes. Studia Logica 64 (3):301-313.
Paul Bankston (1990). Taxonomies of Model-Theoretically Defined Topological Properties. Journal of Symbolic Logic 55 (2):589-603.
Sauro Tulipani (1985). An Algorithm to Determine, for Any Prime P, a Polynomial-Sized Horn Sentence Which Expresses "the Cardinality is Not P". Journal of Symbolic Logic 50 (4):1062-1064.
George Boolos (1980). Omega-Consistency and the Diamond. Studia Logica 39 (2-3):237 - 243.
Joohyung Lee & Vladimir Lifschitz, Safe Formulas in the General Theory of Stable Models (Preliminary Report).
Gregory H. Moore (2011). Early History of the Generalized Continuum Hypothesis: 1878—1938. Bulletin of Symbolic Logic 17 (4):489-532.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,771 of 722,874 )
Recent downloads (6 months)0
How can I increase my downloads?