Discrete Mathematics

... A propositional variable (lowercase letters p, q, r) is a proposition. These variables model true/false statements. The negation of a proposition P, written ¬ P, is a proposition. The conjunction (and) of two propositions, written P ∧ Q, is a proposition. The disjunction (or) of two propositions, wr ...

... A propositional variable (lowercase letters p, q, r) is a proposition. These variables model true/false statements. The negation of a proposition P, written ¬ P, is a proposition. The conjunction (and) of two propositions, written P ∧ Q, is a proposition. The disjunction (or) of two propositions, wr ...

Divide and congruence: From decomposition of modal formulas to preservation of branching and eta-bisimilarity

... Each combination of syntactic restrictions on transition rules induces a corresponding syntactic format for TSSs of the same name. For instance, a TSS is in decent ntyft format if it contains decent ntyft rules only. The following lemma, on the preservation of decency under irredundant provability, ...

... Each combination of syntactic restrictions on transition rules induces a corresponding syntactic format for TSSs of the same name. For instance, a TSS is in decent ntyft format if it contains decent ntyft rules only. The following lemma, on the preservation of decency under irredundant provability, ...

.pdf

... deductive system for TLA (see [L91], for example) will, by definition, be complete for proving Φ ∧ E ⇒ Ψ. In fact, this is one of the advantages of using Program Reduction to extend a complete proof system for Sat into a proof system for ESat—the complete proof system for ESat comes at no cost. Exam ...

... deductive system for TLA (see [L91], for example) will, by definition, be complete for proving Φ ∧ E ⇒ Ψ. In fact, this is one of the advantages of using Program Reduction to extend a complete proof system for Sat into a proof system for ESat—the complete proof system for ESat comes at no cost. Exam ...

Announcement as effort on topological spaces

... rich epistemic setting capturing observational effort and knowledge therefore demands well-equipped models in order to be able to represent the aforementioned concepts. Moss and Parikh (1992) therefore propose subset space semantics for their logic. A subset space is defined to be a pair (X, O), wh ...

... rich epistemic setting capturing observational effort and knowledge therefore demands well-equipped models in order to be able to represent the aforementioned concepts. Moss and Parikh (1992) therefore propose subset space semantics for their logic. A subset space is defined to be a pair (X, O), wh ...