Safety Signatures for First-order Languages and Their Applications
Graduate studies at Western
|Abstract||In several areas of Mathematical Logic and Computer Science one would ideally like to use the set F orm(L) of all formulas of some ﬁrst-order language L for some goal, but this cannot be done safely. In such a case it is necessary to select a subset of F orm(L) that can safely be used. Three main examples of this phenomenon are: • The main principle of naive set theory is the comprehension schema: ∃Z(∀x.x ∈ Z ⇔ A)|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Peter Zahn (2006). A Normative Model of Classical Reasoning in Higher Order Languages. Synthese 148 (2):309 - 343.
James S. Johnson (1973). Axiom Systems for First Order Logic with Finitely Many Variables. Journal of Symbolic Logic 38 (4):576-578.
George Weaver (2011). A General Setting for Dedekind's Axiomatization of the Positive Integers. History and Philosophy of Logic 32 (4):375-398.
Gabriel Sandu (1993). On the Logic of Informational Independence and its Applications. Journal of Philosophical Logic 22 (1):29 - 60.
Jouko Vaananen (2001). Second-Order Logic and Foundations of Mathematics. Bulletin of Symbolic Logic 7 (4):504-520.
Richard Kaye (2007). The Mathematics of Logic: A Guide to Completeness Theorems and Their Applications. Cambridge University Press.
Kenny Easwaran (2010). Logic and Probability. Journal of the Indian Council of Philosophical Research 27 (2):229-253.
Ignacio Jané (1993). A Critical Appraisal of Second-Order Logic. History and Philosophy of Logic 14 (1):67-86.
Sorry, there are not enough data points to plot this chart.
Added to index2009-04-13
Recent downloads (6 months)0
How can I increase my downloads?