๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decidable and enumerable predicate logics of provability

โœ Scribed by Giorgie Dzhaparidze

Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
958 KB
Volume
49
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Logic of proofs and provability
Logic of proofs and provability
โœ Tatiana Yavorskaya (Sidon) ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

In the paper the joint Logic of Proofs and Provability LPP is presented that incorporates both the modality for provability (Israel J. Math. 25 (1976) 287-304) and the proof operator <t=F representing the proof predicate "t is a proof of F " (Technical Report No. CFIS 95-29, Cornell University, 1995

Definability and decidability of binary
Definability and decidability of binary predicates for time granularity
โœ Massimo Franceschet; Angelo Montanari; Adriano Peron; Guido Sciavicco ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 288 KB

In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (respectively equi-column) predicate constraining two time points to belong to

A predicative and decidable characteriza
A predicative and decidable characterization of the polynomial classes of languages
โœ S. Caporaso; M. Zito; N. Galesi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are decidable (membership can be decided by syntactic inspection to the constructions), predicative (according to points of view by Leivant and others), and are obtained by means of increasing restrictions