Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Predicate provability logic with non-modalized quantifiers

From MaRDI portal
Publication:1176101
Jump to:navigation, search

DOI10.1007/BF00370393zbMath0736.03004MaRDI QIDQ1176101

Giorgie Dzhaparidze

Publication date: 25 June 1992

Published in: Studia Logica (Search for Journal in Brave)


zbMATH Keywords

Kripke modelsPeano arithmeticprovability logicpredicate modal logicrecursive enumerabilityGödel numbersGödel-Löb's logic GLprovably binumerableSolovay's logic S


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)




Cites Work

  • Decidable and enumerable predicate logics of provability
  • The predicate modal logic of provability
  • Omega-consistency and the diamond
  • Provability interpretations of modal logic
  • Arithmetization of metamathematics in a general setting
  • The degree of the set of sentences of predicate provability logic that are true under every interpretation
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1176101&oldid=12008934"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki