The Logic of Location

I consider the idea of a propositional logic of location based on the following semantic framework, derived from ideas of Prior. We have a collection L of locations and a collection S of statements such that a statement may be evaluated for truth at each location. Typically one and the same statement may be true at one location and false at another. Given this semantic framework we may proceed in two ways: introducing names for locations, predicates for the relations among them and an “at” preposition to express the value of statements at locations; or introduce statement operators which do not name locations but whose truth-conditional effect depends on the truth or falsity of embedded statements at various locations. The latter is akin to Prior’s approach to tense logic. In any logic of location there will be some basic operators which we can define. By ringing the changes on the topology of locations, different logical systems may be generated, and the challenge for the logician is then in each case to find operators, axioms and rules yielding a proof theory adequate to the semantics. The generality of the approach is illustrated with familiar and not so familiar examples from modal, tense and place logic, mathematics, and even the logic of games.

相似文献   

Constructive Logic, Truth and Warranted Assertability

Shapiro and Taschek have argued that simply using intuitionistic logic and its Heyting semantics, one can show that there are no gaps in warranted assertability. That is, given that a discourse is faithfully modelled using Heyting's semantics for the logical constants, then if a statement S is not warrantedly assertable, its negation ^∼ S is. Tennant has argued for this conclusion on similar grounds. I show that these arguments fail, albeit in illuminating ways. An appeal to constructive logic does not commit one to this strong epistemological thesis, but appeals to semantics of intuitionistic logic none the less do give us certain conclusions about the connections between warranted assertability and truth.     

Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation

Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered.     

Partiality and Its Dual

This paper explores allowing truth value assignments to be undetermined or "partial" (no truth values) and overdetermined or "inconsistent" (both truth values), thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's (first-degree) relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson's "constructible falsity".     

The Pleasures of Anticipation: Enriching Intuitionistic Logic

We explore a relation we call anticipation between formulas, where A anticipates B (according to some logic) just in case B is a consequence (according to that logic, presumed to support some distinguished implicational connective ) of the formula AB. We are especially interested in the case in which the logic is intuitionistic (propositional) logic and are much concerned with an extension of that logic with a new connective, written as a, governed by rules which guarantee that for any formula B, aB is the (logically) strongest formula anticipating B. The investigation of this new logic, which we call ILa, will confront us on several occasions with some of the finer points in the theory of rules and with issues in the philosophy of logic arising from the proposed explication of the existence of a connective (with prescribed logical behaviour) in terms of the conservative extension of a favoured logic by the addition of such a connective. Other points of interest include the provision of a Kripke semantics with respect to which ILa is demonstrably sound, deployed to establish certain unprovability results as well as to forge connections with C. Rauszer's logic of dual intuitionistic negation and dual intuitionistic implication, and the isolation of two relations (between formulas), head-implication and head-linkage, which, though trivial in the setting of classical logic, are of considerable significance in the intuitionistic context.     

Notes on Constructive Negation

We put together several observations on constructive negation. First, Russell anticipated intuitionistic logic by clearly distinguishing propositional principles implying the law of the excluded middle from remaining valid principles. He stated what was later called Peirce’s law. This is important in connection with the method used later by Heyting for developing his axiomatization of intuitionistic logic. Second, a work by Dragalin and his students provides easy embeddings of classical arithmetic and analysis into intuitionistic negationless systems. In the last section, we present in some detail a stepwise construction of negation which essentially concluded the formation of the logical base of the Russian constructivist school. Markov’s own proof of Markov’s principle (different from later proofs by Friedman and Dragalin) is described.     

Intuitionistic Autoepistemic Logic

In this paper we address the problem of combining a logic with nonmonotonic modal logic. In particular we study the intuitionistic case. We start from a formal analysis of the notion of intuitionistic consistency via the sequent calculus. The epistemic operator M is interpreted as the consistency operator of intuitionistic logic by introducing intuitionistic stable sets. On the basis of a bimodal structure we also provide a semantics for intuitionistic stable sets.     

A Few More Useful 8-valued Logics for Reasoning with Tetralattice <Emphasis Type="Italic">EIGHT</Emphasis><Subscript>4</Subscript>

In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN ₃ with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a — incoming data is asserted, d — incoming data is denied, and u — incoming data is neither asserted nor denied, that corresponds to the answer “don’t know”. In so doing, the power-set of 3, that is the set 8 is considered. It turns out that there are not three but four orderings naturally defined on the set 8 that form the tetralattice EIGHT ₄. Besides three ordering relations mentioned above it is an extra uncertainty ordering. Quite predictably, the logics generated by a–order (truth order) and d–order (falsity order) coincide with first-degree entailment. Finally logic with two kinds of operations (a–connectives and d–connectives) and consequence relation defined via a–ordering is considered. An adequate axiomatization for this logic is proposed.     

Representation of interlaced trilattices

Trilattices are algebraic structures introduced ten years ago into logic with the aim to provide a uniform framework for the notions of constructive truth and constructive falsity. In more recent years, trilattices have been used to introduce a number of many-valued systems that generalize the Belnap–Dunn logic of first-degree entailment, proposed as logics of how several computers connected together in a network should think in order to deal with incomplete and possibly contradictory information. The aim of the present work is to develop a first purely algebraic study of trilattices, focusing in particular on the problem of representing certain subclasses of trilattices as special products of bilattices. This approach allows to extend the known representation results for interlaced bilattices to the setting of trilattices and to reduce many algebraic problems concerning these new structures to the better-known framework of lattice theory.     

On Axiomatizing Shramko-Wansing’s Logic

This work treats the problem of axiomatizing the truth and falsity consequence relations, ⊨ _t and ⊨ _f , determined via truth and falsity orderings on the trilattice SIXTEEN ₃ (Shramko and Wansing, 2005). The approach is based on a representation of SIXTEEN ₃ as a twist-structure over the two-element Boolean algebra.     

Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation

The paper is devoted to the contributions of Helena Rasiowa to the theory of non-classical negation. The main results of Rasiowa in this area concerns–constructive logic with strong (Nelson) negation,–intuitionistic negation and some of its generalizations: minimal negation of Johansson and semi-negation.We discuss also the impact of Rasiowa works on the theory of non-classical negation.A lecture presented at the International Conference Trends in Logic III : A. Mostowski, H. Rasiowa and C. Rauszer in memoriam, Warsaw, Ruciane-Nida September 23-26, 2005.     

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).     

The information in intuitionistic logic

Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of ‘factual’ versus ‘procedural’ information, or ‘statics’ versus ‘dynamics’. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its ‘cousin’ epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge.     

A defense of contingent logical truths

A formula is a contingent logical truth when it is true in every model M but, for some model M, false at some world of M. We argue that there are such truths, given the logic of actuality. Our argument turns on defending Tarski’s definition of truth and logical truth, extended so as to apply to modal languages with an actuality operator. We argue that this extension is the philosophically proper account of validity. We counter recent arguments to the contrary presented in Hanson’s ‘Actuality, Necessity, and Logical Truth’ (Philos Stud 130:437–459, 2006).     

Interpolation in Extensions of First-Order Logic

We prove a generalization of Maehara’s lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig’s interpolation property. As a corollary, we obtain a direct proof of interpolation for (classical and intuitionistic) first-order logic with identity, as well as interpolation for several mathematical theories, including the theory of equivalence relations, (strict) partial and linear orders, and various intuitionistic order theories such as apartness and positive partial and linear orders.

     

SUPERVALUATION FIXED-POINT LOGICS OF TRUTH

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.     

Departing from Classical Logic: A Logical Analysis of Personal Construct Theory

This article draws a parallel between personal construct theory and intuitionistic logic i, in order to account for Kelly's claim to have departed from classical logic. Assuming that different theoretical paradigms correspond to different logical languages, it is argued that the constructivist paradigm is linked to intuitionism. Similarities between some key syntactic and semantic features of i logic and the underlying logic of Kelly's theory are made explicit. The strengths and limitations of such an approach are discussed in light of issues emerging from clinical observation and from the philosophy of science.     

D. Z. Phillips and reasonable belief

As an illustration of what Phillips called the “heterogeneity of sense,” this essay concentrates on differences in what is meant by a “reason for belief.” Sometimes saying that a belief is reasonable simply commends the belief’s unquestioned acceptance as a part of what we understand as a sensible outlook. Here the standard picture of justifying truth claims on evidential grounds breaks down; and it also breaks down in cases of fundamental moral and religious disagreement, where the basic beliefs that we hold affect our conception of what counts as a reliable ground of judgment. Phillips accepts the resultant variations in our conceptions of rational judgment as a part of logic, just as Wittgenstein did. All objective means of determining the truth or falsity of an assertion presume some underlying conceptual agreement about what counts as good judgment. This means that the possibility of objective justification is limited. But no pernicious relativism results from this view, for as Wittgenstein said, “After reason comes persuasion.” There is, moreover, a non-objective criterion of sorts in the moral and religious requirement that one be able to live with one’s commitments. In such cases, good judgment is still possible, but it differs markedly from the standard model of making rational inferences.     

On Moderate Pluralism About Truth and Logic

According to moderate truth pluralism, truth is both One and Many. There is a single truth property that applies across all truth-apt domains of discourse, but instances of this property are grounded in different ways. Propositions concerning medium-sized dry goods might be true in virtue of corresponding with reality while propositions pertaining to the law might be true in virtue of cohering with the body of law. Moderate truth pluralists must answer two questions concerning logic: (Q1) Which logic governs inferences concerning each truth-apt domain considered separately? (Q2) Which logic governs inferences that involve several truth-apt domains? This paper has three objectives. The first objective is to present and explain the moderate pluralist’s answers to (Q1) and (Q2). The second objective is to argue that there is a tension between these answers. The answer to (Q1) involves a commitment to a form of logical pluralism. However, reflection on the moderate truth pluralist’s answer to (Q2) shows that they are committed to taking logic to be topic neutrality. This, in turn, forces a commitment to logical monism. It would seem that the moderate truth pluralist cannot have it both ways. The third objective is constructive in nature. I offer an account of what moderate truth pluralists should say about logic and how they might resolve the tension in their view. I suggest that, just like moderate truth pluralists distinguish truth proper and “quasi-truth,” they should endorse a distinction between logic proper and “quasi-logic.” Quasi-truth is truth-like in the sense that instances of quasi-truth ground instances of truth. Quasi-logic is logic-like in the sense that it concerns arguments that are necessarily truth-preserving but are not generally so in a topic neutral way. I suggest that moderate truth pluralists should be monists about truth proper and logic proper but pluralists about quasi-truth and quasi-logic. This allows them to say that logic proper is topic neutral while still accommodating the idea that, for different domains, different arguments may be necessarily truth-preserving.     

Some Useful 16-Valued Logics: How a Computer Network Should Think

In Belnaps useful 4-valued logic, the set 2={T,F} of classical truth values is generalized to the set 4=(2)={,{T},{F},{T,F}}. In the present paper, we argue in favor of extending this process to the set 16=(4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arielis and Avrons notion of a logical bilattice and state a number of open problems for future research.Dedicated to Nuel D. Belnap on the occasion of his 75th Birthday