Predicate logics of expressively strong theories

DOI10.1007/BF02674206zbMath0971.03036OpenAlexW2076225942MaRDI QIDQ1582839

Rostislav E. Yavorsky

Publication date: 30 October 2001

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

predicate calculusPeano arithmeticpredicate logicfirst-order languageatomic formulaexpressively strong theoryGödelian theorypredicate language

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Models of arithmetic and set theory (03C62) Properties of classes of models (03C52) Basic properties of first-order languages and structures (03C07)

Cites Work

• Constructive formalization of the Tennenbaum theorem and its applications
• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS
• Arithmetization of metamathematics in a general setting
• On first-order theories with provability operator
• Grundlagen der Mathematik I
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item