scientific article; zbMATH DE number 3078481
From MaRDI portal
Publication:5817396
zbMath0050.00801MaRDI QIDQ5817396
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ A comprehensive picture of the decidability of mereological theories ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ Computational complexity of theories of a binary predicate with a small number of variables ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Undecidability of equality for codata types ⋮ Unabhängigkeitsbeweise in Teilsystemen der elementaren Zahlentheorie
This page was built for publication: