Arithmetical completeness versus relative completeness

In this paper we study the status of the arithmetical completeness of dynamic logic. We prove that for finitistic proof systems for dynamic logic results beyond arithmetical completeness are very unlikely. The role of the set of natural numbers is carefully analyzed.     

Negationless intuitionism

The present paper deals with natural intuitionistic semantics for intuitionistic logic within an intuitionistic metamathematics. We show how strong completeness of full first order logic fails. We then consider a negationless semantics à la Henkin for second order intuitionistic logic. By using the theory of lawless sequences we prove that, for such semantics, strong completeness is restorable. We argue that lawless negationless semantics is a suitable framework for a constructive structuralist interpretation of any second order formalizable theory (classical or intuitionistic, contradictory or not).     

A Representation Result for Value-based Contraction

Sven-Ove Hansson and Erik Olsson studied in Hansson and Olsson (Notre Dame Journal of Formal Logic, 36(1), 103–119 1995) the logical properties of an operation of contraction first proposed by Isaac Levi in Levi (1991). They provided a completeness result for the simplest version of contraction that they call Levi-contraction but left open the problem of characterizing axiomatically the more complex operation of value-based contraction or saturatable contraction. In this paper we propose an axiomatization for this operation and prove a completeness result for it. We argue that the resulting operation is better behaved than various rival operations of contraction defined in recent years.     

Arithmetical Completeness Theorem for Modal Logic $$\mathsf{}$$

We prove that for any recursively axiomatized consistent extension T of Peano Arithmetic, there exists a \(\Sigma _2\) provability predicate of T whose provability logic is precisely the modal logic \(\mathsf{K}\). For this purpose, we introduce a new bimodal logic \(\mathsf{GLK}\), and prove the Kripke completeness theorem and the uniform arithmetical completeness theorem for \(\mathsf{GLK}\).     

A Modal Logic for Discretely Descending Chains of Sets

We present a modal logic for the class of subset spaces based on discretely descending chains of sets. Apart from the usual modalities for knowledge and effort the standard temporal connectives are included in the underlying language. Our main objective is to prove completeness of a corresponding axiomatization. Furthermore, we show that the system satisfies a certain finite model property and is decidable thus.     

A Game Semantics for System P

In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order semantics of System P. Combining these two results leads to a new completeness proof for System P with respect to its order semantics. Our approach allows us to construct for every inference either a concrete proof of the inference from the rules in System P or a countermodel in the order semantics. Our results rely on the notion of a witnessing set for an inference, whose existence is a concise, necessary and sufficient condition for validity of an inferences in System P. We also introduce an infinitary variant of System P and use the game semantics to show its completeness for the restricted class of well-founded orders.     

Completeness: from Gödel to Henkin

This paper focuses on the evolution of the notion of completeness in contemporary logic. We discuss the differences between the notions of completeness of a theory, the completeness of a calculus, and the completeness of a logic in the light of Gödel's and Tarski's crucial contributions.We place special emphasis on understanding the differences in how these concepts were used then and now, as well as on the role they play in logic. Nevertheless, we can still observe a certain ambiguity in the use of the close notions of completeness of a calculus and completeness of a logic. We analyze the state of the art under which Gödel's proof of completeness was developed, particularly when dealing with the decision problem for first-order logic. We believe that Gödel had to face the following dilemma: either semantics is decidable, in which case the completeness of the logic is trivial or, completeness is a critical property but in this case it cannot be obtained as a corollary of a previous decidability result. As far as first-order logic is concerned, our thesis is that the contemporary understanding of completeness of a calculus was born as a generalization of the concept of completeness of a theory. The last part of this study is devoted to Henkin's work concerning the generalization of his completeness proof to any logic from his initial work in type theory.     

Normal Modal Substructural Logics with Strong Negation

We introduce modal propositional substructural logics with strong negation, and prove the completeness theorems (with respect to Kripke models) for these logics.     

Mereology in Aristotle's Assertoric Syllogistic

How does Aristotle think about sentences like ‘Every x is y’ in the Prior Analytics? A recently popular answer conceives of these sentences as expressing a mereological relationship between x and y: the sentence is true just in case x is, in some sense, a part of y. I argue that the motivations for this interpretation have so far not been compelling. I provide a new justification for the mereological interpretation. First, I prove a very general algebraic soundness and completeness result that unifies the most important soundness and completeness results to date. Then I argue that this result vindicates the mereological interpretation. In contrast to previous interpretations, this argument shows how Aristotle's conception of predication in mereological terms can do important logical work.     

Computability Issues for Adaptive Logics in Multi-Consequence Standard Format

In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way.     

States on Polyadic MV-algebras

This paper is a contribution to the algebraic logic of probabilistic models of ?ukasiewicz predicate logic. We study the MV-states defined on polyadic MV-algebras and prove an algebraic many-valued version of Gaifman’s completeness theorem.     

Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic

Studia Logica - In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic...     

Two Kinds of Completeness and the Uses (and Abuses) of Exclusion Principles

I argue that the completeness of physics is composed of two distinct claims. The first is the commonly made claim that, roughly, every physical event is completely causally determined by physical events. The second has rarely, if ever, been explicitly stated in the literature and is the claim that microphysics provides a complete inventory of the fundamental categories that constitute both the causal features and intrinsic nature of all the events that causally affect the physical universe. After showing that these claims are distinct, I argue that they can be used to solve a difficulty with existing responses to the exclusion problem—namely, that these existing responses also undermine the powerful causal argument for physicalism. Recognizing that there are two kinds of completeness opens up room for the nonreductive physicalist to solve the exclusion problem while also endorsing a modified, cogent causal argument for a kind of physicalism compatible with her position.     

Cut-free sequent calculi for some tense logics

We introduce certain enhanced systems of sequent calculi for tense logics, and prove their completeness with respect to Kripke-type semantics.Presented byMelvin Fitting.     

Gentzen-Type Methods for Bilattice Negation

A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed sequent calculi including CLS (a conservative extension of CL) and CLS_cw (a conservative extension of some bilattice logics, LK and S4). Completeness theorems are given for these calculi with respect to phase semantics, for SLK (a conservative extension and fragment of LK and CLS_cw, respectively) with respect to a classical-like semantics, and for SS4 (a conservative extension and fragment of S4 and CLScw, respectively) with respect to a Kripke-type semantics. The proposed framework allows for an embedding of the proposed calculi into LK, S4 and CL.     

Using Hybrid Logic for Coping with Functions in Subset Spaces

We extend Moss and Parikh’s modal logic for subset spaces by adding, among other things, state-valued and set-valued functions. This is done with the aid of some basic concepts from hybrid logic. We prove the soundness and completeness of the derived logics with regard to the class of all correspondingly enriched subset spaces, and show that these logics are decidable.     

Sequent Calculi for Some Strict Implication Logics

We introduce various sequent systems for propositional logicshaving strict implication, and prove the completeness theoremsand the finite model properties of these systems.The cut-eliminationtheorems or the (modified) subformula properties are provedsemantically.     

语境同义性逻辑(英文)

众所周知,基于可能世界语义的内涵逻辑由于对意义的刻画过于粗粝而导致了所谓的"超内涵问题"。为了解决超内涵问题,出现了各种超内涵逻辑,其中由Suszko提出的带等词的命题逻辑(SCI)是超内涵逻辑中最基本的一种。本文是对SCI的精炼,其动机是语境同义性论题(CST)。该论题认为,同义性标准具有语境依赖性。基于认知语境主义,我们给出了CST的一个论证。通过将SCI中的二元等词修改为一个三元结构,用来表示两个陈述相对某个语境表达同一命题,我们给出了CST的希尔伯特式公理系统。我们证明了该系统相对一个代数模型类是可靠的和完全的。该代数模型的论域由命题构成,同时附带一组命题上的全等关系,用以刻画相对于语境的命题同一性。我们运用该逻辑部分解决了分析悖论这一困扰逻辑学家多年的问题。与我们之前的基于相同动机的论文[17]相比,本文给出的形式语言更加丰富,从而能够表达不同语境之间以及不同语境的同义性之间的关系。     

A logic LU for understanding

Understanding a proposition for an intelligent agent is an important epistemic concept. We first discuss intuitively general logic characteristics of understanding, and give a language and a semantics containing understanding as a modal operator. Secondly, we develop the system LU for the operator, give some results of its proof theory, and then we prove the frame soundness and frame completeness of LU.     

似然性、必然性和恒等:一种相对似然性逻辑

We construct a Hilbert style system RPL for the notion of plausibility measure introduced by Halpern J, and we prove the soundness and completeness with respect to a neighborhood style semantics. Using the language of RPL, we demonstrate that it can define well-studied notions of necessity, conditionals and propositional identity. The paper is partially supported by a project (No. 05JJD720. 40001) granted by the Key Research Institutes for Humanities and Social Sciences of Chinese Ministry of Education.