Isomorphic formulae in classical propositional logic
Kosta Dosen, Zoran Petric
págs. 5-17
Reverse mathematics and infinite traceable graphs
Peter A. Cholak, David Galvin, Reed Solomon
págs. 18-28
Algebraic semantics for the (<>, ¬¬)-fragment of IPC
Katarzyna Slomczynska
págs. 29-37
Non-saturation of the non-stationary ideal on Pk () with of countable cofinality
Pierre Matet
págs. 38-45
A characterization of retracts in certain Fraïssé limits
Igor Dolinka
págs. 46-54
Forcing with the Anti-Foundation axiom
Olivier Esser
págs. 55-62
Quantified universes and ultraproducts
Alireza Mofidi, Seyed-Mohammad Bagheri
págs. 63-74
Indestructibility, measurability, and degrees of supercompactness
Arthur W. Apter
págs. 75-82
The failure of GCH at a degree of supercompactness
Brent Cody
págs. 83-94
Eventually open action
Barbara Majcher-Iwanow
págs. 95-104
The complexity of countable categoricity in finite languages
Aleksander Ivanov
págs. 105-112
On S11 equivalence relations over the natural numbers
Ekaterina B. Fokina, Sy-David Friedman
págs. 113-124
Definably connected nonconnected sets
Antongiulio Fornasiero
págs. 125-126
© 2001-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: