Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten
From MaRDI portal
Publication:1241510
DOI10.1007/BF01182063zbMath0365.02035MaRDI QIDQ1241510
Publication date: 1977
Published in: Manuscripta Mathematica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/154477
03B25: Decidability of theories and sets of sentences
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Semi-conservative reduction
- Diem-Grade Logischer Entscheidungsprobleme
- Undecidable properties of finite sets of equations
- The decision problem for formulas with a small number of atomic subformulas
- Finite models for inequations