The Undecidability of Theories of Groupoids with an Extra Predicate

DOI10.2307/2039719zbMath0273.02032OpenAlexW4241785957MaRDI QIDQ5181677

Solomon A. Garfunkel, James H. Schmerl

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2039719

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Groupoids (i.e. small categories in which all morphisms are isomorphisms) (20L05)

Related Items

Trees, grids, and MSO decidability: from graphs to matroids, A note on definability in fragments of arithmetic with free unary predicates, The structure of the models of decidable monadic theories of graphs

Cites Work

• The Equi-Pappian Property
• Free Loops and Nets and Their Generalizations
• Unnamed Item