On the effective universality of mereological theories
From MaRDI portal
Publication:6094132
DOI10.1002/malq.202100016zbMath1521.03082OpenAlexW3216049426MaRDI QIDQ6094132
Hsing-chien Tsai, Nikolay Bazhenov
Publication date: 12 September 2023
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.202100016
Other nonclassical logic (03B60) Philosophical and critical aspects of logic and foundations (03A05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isomorphisms and algorithmic properties of structures with two equivalences
- Categoricity spectra for polymodal algebras
- Computable isomorphisms of Boolean algebras with operators
- Constructive enumeration of Boolean lattices
- What is classical mereology?
- Examples of nonautostable systems
- Autostability of models
- The quantity of nonautoequivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- General extensional mereology is finitely axiomatizable
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Decidability of general extensional mereology
- Freely generated projective planes with finite computable dimension
- Computable Boolean algebras
- Turing's Legacy
- Notes on models of first-order mereological theories
- Classical mereology is not elementarily axiomatizable
- Effective procedures in field theory
- Decidability of mereological theories
- Degrees coded in jumps of orderings
- Recursively Categorical Linear Orderings
- Computably categorical structures and expansions by constants
- Boolean algebras, Stone spaces, and the iterated Turing jump
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Degrees of Structures
- Metamereology
- Computable Contact Algebras
- CONSTRUCTIVE ALGEBRAS I
- Turing computable embeddings
- Comparing Classes of Finite Structures
- Computable Algebra, General Theory and Theory of Computable Fields
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
This page was built for publication: On the effective universality of mereological theories
