The Axiomatization of Propositional Logic
نویسندگان
چکیده
منابع مشابه
The Axiomatization of Propositional Linear Time Temporal Logic
The article introduces propositional linear time temporal logic as a formal system. Axioms and rules of derivation are defined. Soundness Theorem and Deduction Theorem are proved [9]. The terminology and notation used in this paper have been introduced in the In this paper a, b, c denote boolean numbers. Next we state three propositions: (1) (a ⇒ b ∧ c) ⇒ (a ⇒ b) = 1. (2) (a ⇒ (b ⇒ c)) ⇒ (a ∧ b...
متن کاملWeakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical reasoning. The proof is carried out using a non trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin style completions.
متن کاملTableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus. Propositional Linear Temporal Logic (PLTL) is a very popular...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملPropositional Lax Logic Propositional Lax Logic
We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. As a modal logic it is special since it features a single modal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2016
ISSN: 1898-9934,1426-2630
DOI: 10.1515/forma-2016-0024