Solvable classes of pseudoprenex formulas

DOI10.1007/BF01693983zbMath0449.03012OpenAlexW1974082531MaRDI QIDQ1147118

V. P. Orevkov

Publication date: 1980

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01693983

zbMATH Keywords

derivabilityintuitionistic predicate calculusrefutabilitycompletely finite Kripke modelsreduction classessolvable classes of pseudoprenex formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Solvable cases of the decision problem
• Zum Entscheidungsproblem des logischen Funktionenkalküls
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solvable classes of pseudoprenex formulas