Expressing infinity without foundation
From MaRDI portal
Publication:3984401
DOI10.2307/2275470zbMATH Open0744.03051OpenAlexW2026387431MaRDI QIDQ3984401FDOQ3984401
Authors: Alberto Policriti, Franco Parlamento
Publication date: 27 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275470
Recommendations
Cites Work
Cited In (11)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
- Infinity, in short
- Layered map reasoning: an experimental approach put to trial on sets
- Assumptions of infinity
- Unifying some notions of infinity in ZC and ZF
- Decidability and completeness for open formulas of membership theories
- Stating infinity in set/hyperset theory
- The decidability of the \(\forall ^*\exists\) class and the axiom of foundation
- Set-syllogistics meet combinatorics
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
- Goals and benchmarks for automated map reasoning
This page was built for publication: Expressing infinity without foundation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984401)