scientific article; zbMATH DE number 3078481
From MaRDI portal
Publication:5817396
Cited in
(10)- Undecidability of equality for codata types
- Using computability to measure complexity of algebraic structures and classes of structures
- Unabhängigkeitsbeweise in Teilsystemen der elementaren Zahlentheorie
- Computational complexity of theories of a binary predicate with a small number of variables
- A comprehensive picture of the decidability of mereological theories
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- From Logic to Theoretical Computer Science – An Update
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
- A decidable class of inferences in first-order objective Bayesian inductive logic
- Certified _1-sentences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5817396)
