Algebraic closure in continuous logic.
Henson, C.Ward, Tellez, Hernando (2007)
Revista Colombiana de Matemáticas
Similarity:
Displaying similar documents to “Remarks on intuitionistic modal logics.”
Algebraic closure in continuous logic.
Completeness theorem for logic with imprecise and conditional probabilities.
Ognjanović, Zoran, Marković, Zoran, Rašković, Miodrag (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Probability Logics
Zoran Ognjanović, Miodrag Rašković, Zoran Marković (2009)
Zbornik Radova
Similarity:
Probability logics with vector-valued measures
Vladimir Ristić (2009)
Kragujevac Journal of Mathematics
Similarity:
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:
Monotone sequent calculus and resolution
Marta Bílková (2001)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We study relations between propositional Monotone Sequent Calculus (MLK --- also known as Geometric Logic) and Resolution with respect to the complexity of proofs, namely to the concept of the polynomial simulation of proofs. We consider Resolution on sets of monochromatic clauses. We prove that there exists a polynomial simulation of proofs in MLK by intuitionistic proofs. We show a polynomial simulation between proofs from axioms in MLK and corresponding proofs of contradiction (refutations)...
BL-algebra of fractions relative to an -closed system.
Buşneag, Dumitru, Piciu, Dana (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
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...