Results 21 to 30 of about 27,151 (281)
Note on Probability of Logical Sentences and the Linda Problem
Analecta Cracoviensia, 2023 This paper presents a logical concept of probability which seems to be obvious, as it is, but the author is not aware of any elaboration of a developed studies on the issue or of any special philosophical application of it.
Adam Olszewski
doaj +1 more source
An Alternative Natural Deduction for the Intuitionistic Propositional Logic [PDF]
, 2016 A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus ...
Ilić, Mirjana
core +1 more source
Characterisation of Strongly Normalising lambda-mu-Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types.
Steffen van Bakel +2 more
doaj +1 more source
Axioms, 2023 Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL.
Zhe Lin, Minghui Ma
doaj +1 more source
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj +1 more source
Two loop detection mechanisms: a comparison [PDF]
, 1997 In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
D. Sahlin, J.-Y. Girard, R. Dyckhoff
core +4 more sources
Classical Logic in the Quantum Context
Quantum Reports, 2020 It is generally accepted that quantum mechanics entails a revision of the classical propositional calculus as a consequence of its physical content. However, the universal claim according to which a new quantum logic is indispensable in order to model ...
Andrea Oldofredi
doaj +1 more source
More efficient proof-search for sequents of temporal logic
Lietuvos Matematikos Rinkinys, 2022 The present paper deals with efficiency improvement of backward proof-search of sequents of propositional linear temporal logic, using a loop-type sequent calculus.
Romas Alonderis
doaj +1 more source
, 2016 Quantified Boolean formulas (QBFs) generalize propositional formulas by admitting quantifications over propositional variables. QBFs can be viewed as (restricted) formulas of first-order predicate logic and easy translations of QBFs into first-order ...
Egly, Uwe
core +2 more sources
Proof Complexity of Propositional Default Logic [PDF]
, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic.
Beyersdorff, O +4 more
core +3 more sources