Results 11 to 20 of about 44,803 (280)
Fullness and Decidability in Continuous Propositional Logic
In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form {¬,∸,f} where f is a unary connective.
Xuanzhi Ren
doaj +1 more source
A Neighbourhood Semantics for the Logic TK
The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK. Thus, by using
Cezar A. Mortari +1 more
doaj +3 more sources
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj +1 more source
Classical Logic in the Quantum Context
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
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae [PDF]
Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a ...
Paola Bruscoli +3 more
doaj +1 more source
Qualitative Choice Logic For Modeling Experts Recommendations of Antibiotics
Qualitative Choice Logic (QCL) is a logic-based formalism for preference handling. The logic adds to classical propositional logic a new connective called ordered disjunction (~).x~y intuitively means: if possible x, but if x is not possible then at ...
karima sedki +2 more
doaj +1 more source
On the Expressive Power of Sub-Propositional Fragments of Modal Logic [PDF]
Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal, and spatial ...
Davide Bresolin +2 more
doaj +1 more source
Formal Logic for Informal Logicians
Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially
David Sherry
doaj +1 more source
Propositional logic extended with a pedagogically useful relevant implication [PDF]
First and foremost, this paper concerns the combination of classical propositional logic with a relevant implication. The proposed combination is simple and transparent from a proof theoretic point of view and at the same time extremely useful for ...
Batens, Diderik
core +2 more sources
Classical Combinatory Logic [PDF]
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages.
Karim Nour
doaj +1 more source

