Non-Computability of the Equational Theory of Polyadic Algebras (original) (raw)
Related papers
On the equational theory of representable polyadic equality algebras (extended abstract)
Logic Journal of IGPL, 1998
Non-finite-axiomatizability results in algebraic logic
Journal of Symbolic Logic, 1992
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
Annals of Pure and Applied Logic, 1997
Generalizing Computability Theory to Abstract Algebras
Turing’s Revolution, 2015
On the search for a finitizable algebraization of first order logic
Logic Journal of IGPL, 2000
Computability and the algebra of fields: Some affine constructions
The Journal of Symbolic Logic, 1980
Decidability and Complexity of Finitely Closable Linear Equational Theories
Lecture Notes in Computer Science, 2001
Non-computable models of certain first order theories
2017 IEEE 14th International Scientific Conference on Informatics, 2017
Abstract computability and algebraic specification
ACM Transactions on Computational Logic, 2002
Universal equational theories and varieties of algebras
Annals of Mathematical Logic, 1979
Expressibility in the elementary theory of recursively enumerable sets with realizability logic
Algebra and Logic, 1981
Studia Scientiarum Mathematicarum Hungarica, 2013
Bare canonicity of representable cylindric and polyadic algebras
arXiv preprint arXiv:1202.5961, 2012
On the isomorphism problem for some classes of computable algebraic structures
Archive for Mathematical Logic, 2022
Computability-Theoretic Complexity of Countable Structures
Bulletin of Symbolic Logic, 2002
Enumeration Reducibility and Computable Structure Theory
2017
2013
Decision problems for equational theories of relation algebras
Memoirs of the American Mathematical Society, 1997
Abstract Computability, Algebraic Specification and Initiality
Computing Research Repository, 2001
Epimorphisms in cylindric algebras and definability in finite variable logic
Algebra universalis, 2009
Completeness theorems, incompleteness theorems and models of arithmetic
Transactions of the American Mathematical Society, 1978
The representations of polyadic-like equality algebras
arXiv (Cornell University), 2011
Representability is not decidable for finite relation algebras
Transactions of the American Mathematical Society, 1999
Complexity of equational theory of relational algebras with standard projection elements
Synthese, 2015
Open problems in the theory of constructive algebraic systems
Contemporary Mathematics, 2000
On Recognisable Properties of Associative Algebras
Journal of Symbolic Computation, 1988
Finite algebras of relations are representable on finite sets
Journal of Symbolic Logic, 1999
Exploring Canonical Axiomatisations of Representable Cylindric Algebras
2011
Polyadic and cylindric algebras of sentences
MLQ, 2006
On arithmetical first-order theories allowing encoding and decoding of lists
Theoretical Computer Science, 1999
A corrected strategy for proving no finite variable axiomatisation exists for RRA
2021
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
Mathematics and Computers in Simulation, 2004
The finite embeddability property for residuated lattices, pocrims and BCK-algebras
Algebra Universalis, 2002
On the definition and the representability of quasi-polyadic equality algebras
Mathematical Logic Quarterly, 2016