Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-qpj69 Total loading time: 1.233 Render date: 2021-02-26T02:20:46.800Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
The Journal of Symbolic Logic The Journal of Symbolic Logic

Article contents

The axiom of elementary sets on the edge of Peircean expressibility

Published online by Cambridge University Press:  12 March 2014

Andrea Formisano ,
Eugenio G. Omodeo  and
Alberto Policriti
Andrea Formisano
Affiliation:
Dipartimento di Informatica, UniversitÀ di Laquila, Via Vetoio–Loc, Coppito, 67010 l'Aquila, ItalyE-mail:, formisano@di.univaq.it
Eugenio G. Omodeo
Affiliation:
Dipartimento di Matematica e Informatica, UniversitÀ di Trieste, Via Valerio, 12/B, 34127 Trieste, ItalyE-mail:, eomodeo@univ.trieste.it
Alberto Policriti
Affiliation:
Dipartimento di Matematica e Informatica, UniversitÀ di Udine, Via Delle Scienze 206-Loc. Rizzi, 33100 Udine, ItalyE-mail:, policrit@dimi.uniud.it
Corresponding
E-mail address:
formisano@di.univaq.it
eomodeo@univ.trieste.it
policrit@dimi.uniud.it
Get access
Rights & Permissions[Opens in a new window]

Abstract

Being able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables is crucially important for a satisfactory equational rendering of set theories along the lines proposed by Alfred Tarski and Steven Givant in their monograph of 1987.

The main achievement of this paper is the proof that the ‘kernel’ set theory whose postulates are extensionality. (E), and single-element adjunction and removal. (W) and (L), cannot be axiomatized by means of three-variable sentences. This highlights a sharp edge to be crossed in order to attain an ‘algebraization’ of Set Theory. Indeed, one easily shows that the theory which results from the said kernel by addition of the null set axiom, (N), is in its entirety expressible in three variables.

Keywords

Weak set theories n-variable expressibility pebble games
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 70 , Issue 3 , September 2005 , pp. 953 - 968
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below.
If you should have access and can't see this content please contact technical support.

References

[1]Barwise, J., On Moschovakis closure ordinals, this Journal, vol. 42 (1977), pp. 292–296.Google Scholar
[2]Dawar, A., Finite models and finitely many variables, Banach Center Publications, vol. 46, Institute of Mathematics, Polish Academy of Sciences, 1999.Google Scholar
[3]Ebbinghaus, H.-D. and Flum, J., Finite model theory, Perspectives in Mathematical Logic, Springer, 1999, Second revised and enlarged edition.Google Scholar
[4]Formisano, A., Omodeo, E. G., and Policriti, P., Three-variable statements of set-pairing, Theoretical Computer Science, vol. 322 (2004), no. 1, pp. 147–173.CrossRefGoogle Scholar
[5]Formisano, A., Omodeo, E. G., and Temperini, M., Goals and benchmarks for automated map reasoning, Journal of Symbolic Computation, vol. 29 (2000), no. 2, Special issue. (M.-P Bonacina and U. Furbach, editors).CrossRefGoogle Scholar
[6]van Heijenoort, J. (editor), From Frege to GÖdel— A source book in mathematical logic, 1879–1931, 3rd printing ed., Source books in the history of the sciences, Harvard University Press, 1977.Google Scholar
[7]Hodkinson, I., Finite variable logics, Bulletin of the European Association for Theoretical Computer Science, vol. 51 (1993), pp. 111–140, Columns: Logic in Computer Science.Google Scholar
[8]Immerman, N., Upper and lower bounds for first order expressibility, Journal of Computer and System Sciences, vol. 25 (1982), no. 1, pp. 76–98.CrossRefGoogle Scholar
[9]Immerman, N. and Kozen, D., Definability with bounded number of bound variables, Information and Computation, vol. 83 (1989), no. 2, pp. 121–139.CrossRefGoogle Scholar
[10]Kolaitis, P. G. and Vardi, M. Y., On the expressive power of variable-confined logics, Proceedings, 11th annual IEEE symposium on logic in computer science (New Brunswick, New Jersey), IEEE Computer Society Press, 1996, pp. 348–359.Google Scholar
[11]Kwatinetz, M. K., Problems of expressibility infinite languages, Ph.D. thesis, University of California, Berkeley, 1981.Google Scholar
[12]Tarski, A., Some metalogical results concerning the calculus of relations, this Journal, vol. 18 (1953), pp. 188–189.Google Scholar
[13]Tarski, A. and Givant, S., A formalization of Set Theory without variables, Colloquium Publications, vol. 41, American Mathematical Society, 1987.Google Scholar
[14]Thomas, W., Languages, automata and logic, Handbook of formal languages, vol. III (Rozenberg, G. and Salomaa, A., editors), Springer, 1997, pp. 389–455.CrossRefGoogle Scholar
[15]Zermelo, E., Untersuchungen Über die Grundlagen der Mengenlehre I, In Heijenoort [6], (English translation), pp. 199–215.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 8 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 26th February 2021. This data will be updated every 24 hours.

2 Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The axiom of elementary sets on the edge of Peircean expressibility
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

The axiom of elementary sets on the edge of Peircean expressibility
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

The axiom of elementary sets on the edge of Peircean expressibility
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *