The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The Axiomatization of Propositional Linear Time Temporal Logic”

The Derivations of Temporal Logic Formulas

Mariusz Giero (2012)

Formalized Mathematics

Similarity:

This is a preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [12]. We introduce n-ary connectives and prove their properties. We derive temporal logic formulas.

Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem

Marco Caminati (2011)

Formalized Mathematics

Similarity:

Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster...

Strong normalization proofs for cut elimination in Gentzen's sequent calculi

Elias Bittar (1999)

Banach Center Publications

Similarity:

We define an equivalent variant L K s p of the Gentzen sequent calculus L K . In L K s p weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules L K s p by a finite rewriting system; the termination of this rewriting system can be machine checked. We give also a self-contained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation;...

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.

Weak variants of Martin's Axiom

J. Barnett (1992)

Fundamenta Mathematicae

Similarity:

Examples exist of smooth maps on the boundary of a smooth manifold M which allow continuous extensions over M without fixed points but no such smooth extensions. Such maps are studied here in more detail. They have a minimal fixed point set when all transversally fixed maps in their homotopy class are considered. Therefore we introduce a Nielsen fixed point theory for transversally fixed maps on smooth manifolds without or with boundary, and use it to calculate the minimum number of...