Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten (Q1241510): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Diem-Grade Logischer Entscheidungsprobleme / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite models for inequations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-conservative reduction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The decision problem for formulas with a small number of atomic subformulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5590814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undecidable properties of finite sets of equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank |
Latest revision as of 22:10, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten |
scientific article |
Statements
Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten (English)
0 references
1977
0 references
0 references