排序方式: 共有181条查询结果,搜索用时 15 毫秒
131.
132.
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. 相似文献
133.
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. 相似文献
134.
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. 相似文献
135.
Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong
Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question
open for the supervaluation fixed-point logic of truth and its variants. We show that the principal supervaluation fixed point
logic of truth, when thought of as consequence relation, is highly complex: it is not even analytic. We also consider variants,
engendered by a stronger notion of ‘fixed point’, and by variant supervaluation schemes. A ‘logic’ is often thought of, not
as a consequence relation, but as a set of sentences – the sentences true on each interpretation. We axiomatize the supervaluation
fixed-point logics so conceived. 相似文献
136.
Nick Bezhanishvili 《Studia Logica》2008,90(2):139-159
In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from
a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular
cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas
and use this criterion to obtain a simple proof that every locally tabular intermediate logic is axiomatizable by Jankov-de
Jongh formulas. We also show that not every intermediate logic is axiomatizable by frame based formulas.
Presented by Johan van Benthem 相似文献
137.
Dorota Leszczyńska-Jasion 《Studia Logica》2008,89(3):365-399
The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5.
Presented by Jacek Malinowski 相似文献
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. 相似文献