Results 11 to 20 of about 1,012,276 (331)
From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic [PDF]
Studia Logica: An International Journal for Symbolic Logic, 2022 Proof-theoretic semantics (P-tS) is the approach to meaning in logic based on proof (as opposed to truth). There are two major approaches to P-tS: proof-theoretic validity (P-tV) and base-extension semantics (B-eS). The former is a semantics of arguments,
A. Gheorghiu, D. Pym
semanticscholar +1 more source
Multi-type display calculus for propositional dynamic logic [PDF]
Journal of Logic and Computation, 2016 We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.
S. Frittella +3 more
semanticscholar +1 more source
Jaccard Distance of Logical Formulas and Its Application
Jisuanji kexue yu tansuo, 2020 Quantifying the related concepts of propositional logic is a new method of propositional logic research. It is differe.nt from the syntax and semantics method and is a powerful tool for studying the structure of propositional sets.
YU Peng
doaj +1 more source
Information and Computation, 1997 The authors investigate the use of a special intuitionistic modal logic with several applications to the performance evaluation of computer hardware. The logic contains a single modal operator enjoying aspects of ``possibility'' and ``necessity''. Several formal properties of the logic are well developed.
Fairtlough, Matt, Mendler, Michael
openaire +2 more sources
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
Lietuvos Matematikos Rinkinys, 2008 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
Intuitionistic implication makes model checking hard [PDF]
Logical Methods in Computer Science, 2012 We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
Fullness and Decidability in Continuous Propositional Logic
Mathematics, 2022 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
Annals of Pure and Applied Logic, 2017 We consider team semantics for propositional logic, continuing our previous work (Yang & V\"a\"an\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation.
Yang, F., Väänänen, J.
openaire +5 more sources
The Propositional Logic of Frege’s Grundgesetze: Semantics and Expressiveness
Journal for the History of Analytical Philosophy, 2017 In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds
Eric D. Berg, Roy T. Cook
doaj +1 more source
Unified theory of integral true degrees in NM theory
Xibei Gongye Daxue Xuebao, 2023 Based on the NM propositional logic system of nilpotent minimum logic, the concept of the integral truth degree of the formula is firstly proposed by integrating the function induced by the formula, and the MP rule and HS rule of the integral truth ...
WANG Bo, HUI Xiaojing, LU Xing
doaj +1 more source