The Derivations of Temporal Logic Formulas

Mariusz Giero

Displaying similar documents to “The Derivations of Temporal Logic Formulas”

A Parigot-style linear $λ$ -calculus for full intuitionistic linear logic.

de Paiva, Valeria, Ritter, Eike (2006)

Theory and Applications of Categories [electronic only]

Similarity:

Normal forms in partial modal logic

Jan Jaspars (1993)

Banach Center Publications

Similarity:

A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].

What the finitization problem is not

A. Simon (1993)

Banach Center Publications

Similarity:

Corcoran's Aristotelian syllogistic as a subsystem of first-order logic.

Andrade, Edgar J., Becerra, Edward (2007)

Revista Colombiana de Matemáticas

Similarity:

Computational Interrpretations of Logics

Silvia Ghilezan, Silvia Likavec (2009)

Zbornik Radova

Similarity:

An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.

Rimatskiĭ, V.V. (2009)

Sibirskij Matematicheskij Zhurnal

Similarity:

Strong completeness of the Lambek Calculus with respect to Relational Semantics

Szabolcs Mikulás (1993)

Banach Center Publications

Similarity:

In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.