排序方式: 共有181条查询结果,搜索用时 31 毫秒
131.
In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior's MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Intto MIPC. As a result we obtain two different versions of Glivenko's theorem for logics over MIPC. Since MIPCcan be thought of as a one-variable fragment of the intuitionistic predicate logic Q-Int, one of the versions of Glivenko's theorem for logics over MIPCis closely related to that for intermediate predicate logics obtained by Umezawa [27] and Gabbay [15]. Another one is rather surprising. 相似文献
132.
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux. 相似文献
133.
Three Complexity Problems in Quantified Fuzzy Logic 总被引:1,自引:0,他引:1
We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01]. 相似文献
134.
135.
This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics
of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular
paradigm, namely the proof-theoretic semantics of the logical operations.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
136.
The aim of this paper is to apply properties of the double dual endofunctor on the category of bounded distributive lattices
and some extensions thereof to obtain completeness of certain non-classical propositional logics in a unified way. In particular,
we obtain completeness theorems for Moisil calculus, n-valued Łukasiewicz calculus and Nelson calculus. Furthermore we show some conservativeness results by these methods.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
137.
Peter Verdée 《Synthese》2009,167(1):93-104
In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven
here that the consequence set of some recursive premise sets is -complete. So, the complexity results in (Horsten and Welch, Synthese 158:41–60, 2007) are mistaken for adaptive logics using
the minimal abnormality strategy. 相似文献
138.
Wojciech Buszkowski 《Studia Logica》2007,87(2-3):145-169
We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars.
The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system
of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid.
Special Issue Categorial Grammars and Pregroups Edited by
Wojciech Buszkowski and Anne Preller 相似文献
139.
Patrick Allo 《Journal of Philosophical Logic》2007,36(6):659-694
Up to now theories of semantic information have implicitly relied on logical monism, or the view that there is one true logic.
The latter position has been explicitly challenged by logical pluralists. Adopting an unbiased attitude in the philosophy
of information, we take a suggestion from Beall and Restall at heart and exploit logical pluralism to recognise another kind
of pluralism. The latter is called informational pluralism, a thesis whose implications for a theory of semantic information
we explore.
Research Assistant of the Fund for Scientific Research – Flanders (Belgium) 相似文献
140.
The paper aims at providing the multi-modal propositional logicLTK with a sound and complete axiomatisation. This logic combinestemporal and epistemic operators and focuses on m odeling thebehaviour of a set of agents operating in a system on the backgroundof a temporal framework. Time is represented as linear and discrete,whereas knowledge is modeled as an S5-like modality. A furthermodal operator intended to represent environment knowledge isadded to the system in order to achieve the expressive powersufficient to describe the piece of information available tothe agents at each moment in the flow of time. 相似文献