Weak Completeness Theorem for Propositional Linear Time Temporal Logic

Mariusz Giero

Displaying similar documents to “Weak Completeness Theorem for Propositional Linear Time Temporal Logic”

The Properties of Sets of Temporal Logic Subformulas

Mariusz Giero (2012)

Formalized Mathematics

Similarity:

This is a second 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 [17]. We introduce two modified definitions of a subformula. In the former one we treat until-formula as indivisible. In the latter one, we extend the set of subformulas of until-formulas by a special disjunctive formula. This is needed to construct a temporal model. We also...

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.

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

de Paiva, Valeria, Ritter, Eike (2006)

Theory and Applications of Categories [electronic only]

Similarity:

A note on naturally embedded ternary trees.

Kuba, Markus (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Logic with Conditional Probability Operators

Dragan Doder, Bojan Marinković, Petar Maksimović, Aleksandar Perović (2010)

Publications de l'Institut Mathématique

Similarity:

What the finitization problem is not

A. Simon (1993)

Banach Center Publications

Similarity:

The combinatorics of evolutionary trees---a survey.

Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Dissimilarity vectors of trees are contained in the tropical Grassmannian.

Iriarte Giraldo, Benjamin (2010)

The Electronic Journal of Combinatorics [electronic only]

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.

A Logic for Reasoning About Qualitative Probability

Angelina Ilić-Stepić (2010)

Publications de l'Institut Mathématique

Similarity:

A new family of Markov branching trees: the alpha-gamma model.

Chen, Bo, Ford, Daniel, Winkel, Matthias (2009)

Electronic Journal of Probability [electronic only]

Similarity:

Tree compression pushdown automaton

Jan Janoušek, Bořivoj Melichar, Martin Poliak (2012)

Kybernetika

Similarity:

A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with $n$ nodes, the automaton has at most $n + 1$ states, its transition function cardinality is at most $4 n$ and there are $2 n + 1$ pushdown store symbols. If hashing is used...