Infinity, in short

DOI10.1093/LOGCOM/EXR020zbMath1284.03231OpenAlexW2168204748MaRDI QIDQ4902312

Alexandru I. Tomescu, Alberto Policriti, Eugenio Giovanni Omodeo

Publication date: 14 January 2013

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

satisfiabilityBernays-Schönfinkel-Ramsey classdecision algorithmsnon-well-founded setscomputable set theoryinfinity axiom

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)

Related Items (1)

Set-syllogistics meet combinatorics

This page was built for publication: Infinity, in short