Safety Signatures for First-order Languages and Their Applications
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)|
|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
Axiom Systems for First Order Logic with Finitely Many Variables.James S. Johnson - 1973 - Journal of Symbolic Logic 38 (4):576-578.
A General Setting for Dedekind's Axiomatization of the Positive Integers.George Weaver - 2011 - History and Philosophy of Logic 32 (4):375-398.
On the Logic of Informational Independence and its Applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
Second-Order Logic and Foundations of Mathematics.Jouko Vaananen - 2001 - Bulletin of Symbolic Logic 7 (4):504-520.
The Mathematics of Logic: A Guide to Completeness Theorems and Their Applications.Richard Kaye - 2007 - Cambridge University Press.
Logic and Probability.Kenny Easwaran - 2010 - Journal of the Indian Council of Philosophical Research 27 (2):229-253.
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?