Infinity, in short

DOI10.1093/LOGCOM/EXR020MaRDI QIDQ4902312zbMATH OpenOpenAlexFDO

Authors Alberto Policriti, Alexandru I. Tomescu, Eugenio Omodeo

Publication date 14 January 2013

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exr020

zbMATH Keywords

Bernays-Schönfinkel-Ramsey classcomputable set theorydecision algorithmsinfinity axiomnon-well-founded setssatisfiability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30) Nonclassical and second-order set theories (03E70)

Recommendations

• Statements of ill-founded infinity in set theory
• Stating infinity in set/hyperset theory
• Expressing infinity without foundation
• Set-syllogistics meet combinatorics
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability

Cited in

(5)

• Set-syllogistics meet combinatorics
• Stating infinity in set/hyperset theory
• Statements of ill-founded infinity in set theory
• Expressing infinity without foundation
• How far is `infinity'?

This page was built for publication: Infinity, in short

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902312)