In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.

Firstly I characterize Simple Partial Logic (SPL) as the generalization and extension of a certain two-valued logic. Based on the characterization I present two definitions of validity in SPL. Finally I show that given my characterization these two definitions are more appropriate than other definitions that have been prevalent, since both have some desirable semantic properties that the others lack.

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-rule.

In my paper 'Validity in Simple Partial Logic'(2002) I made comparison between several definitions of validity in Simple Partial Logic(SPL) and adopted two of them as most appropriate. In this paper, after elaborating more on these two definitions than in my previous paper and considering the characteristics of Partial Semantics, in which these definitions are given, I construct a tableau proof system and prove its soundness and completeness. Then, based on the characterization of Partial (...) Semantics, I will show that we can regard SPL as a logic of extensional alethic modality. (shrink)

The aim of the paper is to develop the notion of partial probability distributions as being more realistic models of belief systems than the standard accounts. We formulate the theory of partial probability functions independently of any classical semantic notions. We use the partial probability distributions to develop a formal semantics for partial propositional calculi, with extensions to predicate logic and higher order languages. We give a proof theory for the partial logics and obtain (...) soundness and completeness results. (shrink)

Simple partial logic (=SPL) is, broadly speaking, an extensional logic which allows for the truth-value gap. First I give a system of propositional SPL by partializing classical logic, as well as extending it with several non-classical truth-functional operators. Second I show a way based on SPL to construct a system of tensed ontology, by representing tensed statements as two kinds of necessary statements in a linear model that consists of the present and future worlds. Finally I (...) compare that way with other two ways based on Łukasiewicz’s three-valued logic and branching temporal logic. (shrink)

We propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the notions of honesty and circumscription in this logic: What is the state of an agent that only knows and which honest enable such circumscription? Redefining stable sets enables us to provide suitable syntactic (...) and semantic criteria for honesty. The rough syntactic definition of honesty is the existence of a minimal stable expansion, so the problem resides in the ordering relation underlying minimality. We discuss three different proposals for this ordering, together with their semantic counterparts, and show their effects on the induced notions of honesty. (shrink)

We propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the notions of honesty and circumscription in this logic: What is the state of an agent that 'only knows φ' and which honest φ enable such circumscription? Redefining stable sets enables us to provide (...) suitable syntactic and semantic criteria for honesty. The rough syntactic definition of honesty is the existence of a minimal stable expansion, so the problem resides in the ordering relation underlying minimality. We discuss three different proposals for this ordering, together with their semantic counterparts, and show their effects on the induced notions of honesty. (shrink)

We associate the semantic game with chance moves conceived by Blinov with Blamey’s partial logic. We give some equivalent alternatives to the semantic game, some of which are with a third player, borrowing the idea of introducing the pseudo-player called Nature in game theory. We observe that IF propositional logic proposed by Sandu and Pietarinen can be equivalently translated to partial logic, which implies that imperfect information may not be necessary for IF propositional logic. (...) We also indicate that some independent quantifiers can be regarded as dependent quantifiers of indeterminate sequence, using the interjunction connective in partial logic. We conclude our paper by indicating some further research in a more general setting. (shrink)

Two distinct and apparently "dual" traditions of non-classical logic, three-valued logic and paraconsistent logic, are considered here and a unified presentation of "easy-to-handle" versions of these logics is given, in which full naive set theory, i.e. Frege's comprehension principle + extensionality, is not absurd.

Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking (...) each individual finite formula (modulo equivalence) to be a possibility, rather than each infinite maximally consistent set of formulas as in the usual canonical world models. Constructing these locally finite canonical models involves solving a problem in general modal logic of independent interest, related to the study of adjoint pairs of modal operators: for a given modal logic L, can we find for every formula phi a formula f(phi) such that for every formula psi, phi -> BOX psi is provable in L if and only if f(phi) -> psi is provable in L? We answer this question for a number of standard modal logics, using model-theoretic arguments with world semantics. This second main result allows us to build for each logic a canonical possibility model out of the lattice of formulas related by provable implication in the logic. (shrink)

In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition projection, namely that they lack “flexibility,” is based on a misconception. Partial logics can give rise to flexible predictions without postulating any ad hoc ambiguities. (...) Finally, it is shown how the partial foundation can be combined with a dynamic system of common-ground maintenance to account for accommodation. (shrink)

We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two players. This game-theoretic approach yields an interpretation where partiality is generated (...) as a property of non-determinacy of games. Over-defined values are produced by adding a weak, contradictory negation or, alternatively, by relaxing the assumption that games are strictly competitive. In general, particular forms of extensive imperfect information games give rise to a generalised propositional logic where various forms of informational dependencies and independencies of connectives can be studied. (shrink)

The total and the sharp character of orthodox quantum logic has been put in question in different contexts. This paper presents the basic ideas for a unified approach to partial and unsharp forms of quantum logic. We prove a completeness theorem for some partial logics based on orthoalgebras and orthomodular posets. We introduce the notion of unsharp orthoalgebra and of generalized MV algebra. The class of all effects of any Hilbert space gives rise to particular examples (...) of these structures. Finally, we investigate the relationship between unsharp orthoalgebras, generalized MV algebras, and orthomodular lattices. (shrink)

The problem of future contingents is regarded as an important philosophical problem in connection with determinism and it should be treated by tense logic. Prior’s early work focused on the problem, and later Prior studied branching-time tense logic which was invented by Kripke. However, Prior’s idea to use three-valued logic for the problem seems to be still alive. In this paper, we consider partial and paraconsistent approaches to the problem of future contingents. These approaches theoretically meet (...) Aristotle’s interpretation of future contingents. (shrink)

Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking (...) each individual finite formula (modulo equivalence) to be a possibility, rather than each infinite maximally consistent set of formulas as in the usual canonical world models. Constructing these locally finite canonical models involves solving a problem in general modal logic of independent interest, related to the study of adjoint pairs of modal operators: for a given modal logic L, can we find for every formula φ a formula f(φ) such that for every formula ψ, φ → []ψ is provable in L if and only if f(φ) → ψ is provable in L? We answer this question for a number of standard modal logics, using model-theoretic arguments with world semantics. This second main result allows us to build for each logic a canonical possibility model out of the lattice of formulas related by provable implication in the logic. (shrink)

According to orthodoxy, there are two basic moods of supposition: indicative and subjunctive. The most popular formalizations of the corresponding norms of suppositional judgement are given by Bayesian conditionalization and Lewisian imaging, respectively. It is well known that Bayesian conditionalization can be generalized (via Jeffrey conditionalization) to provide a model for the norms of partial indicative supposition. This raises the question of whether imaging can likewise be generalized to model the norms of ‘partial subjunctive supposition’. The present article (...) casts doubt on whether the most natural generalizations of imaging are able to provide a plausible account of the norms of partial subjunctive supposition. (shrink)

As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a game. More precisely, dependency graphs play two roles. First, when we say that variable x depends on variable y, then (...) we mean that when a strategy assigns a value to variable x, it can be informed by the value that has been assigned to y. Second, and as a consequence of the first property, they capture a richer and more plausible model of concurrency than the simultaneous-action model implicit in conventional Boolean games. Dependency graphs implicitly define a partial ordering of the run-time events in a game: if x is dependent on y, then the assignment of a value to y must precede the assignment of a value to x; if x and y are independent, however, then we can say nothing about the ordering of assignments to these variables—the assignments may occur concurrently. We refer to Boolean games with dependency graphs as partial-order Boolean games. After motivating and presenting the partial-order Boolean games model, we explore its properties. We show that while some problems associated with our new games have the same complexity as in conventional Boolean games, for others the complexity blows up dramatically. We also show that the concurrency in partial-order Boolean games can be modelled using a closure-operator semantics, and conclude by considering the relationship of our model to Independence-Friendly logic. (shrink)

The purpose of the present note is to advertise an interesting conjecture concerning a well-known translation in modal logic, by confirming a (highly restricted) special case of the conjecture.

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent (...) logics once the right set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

Implicational tonoid logics and their relational semantics have been introduced by Yang and Dunn. This paper extends this investigation to implicational partial Galois logics. For this, we first define some implicational partial gaggle logics as special kinds of implicational tonoid logics called “implicational partial Galois logics.” Next, we provide Routley–Meyer-style relational semantics for finitary those logics.

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system of independence (...) class='Hi'>logic by giving explicit derivations for Armstrong's Axioms and the Geiger-Paz-Pearl axioms of dependence and independence atoms. (shrink)

When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence. This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain approach. Assuming (...) that all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints. I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains. (shrink)

This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to nonpersistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of Nelson. We provide simple semantics, sequential calculi, completeness and decidability proofs.

Em Science and Partial Truth (da Costa and French 2003) argumentamos que inconsistências no raciocínio científico podem ser acomodadas pela combinação de estruturas parciais e quase-verdade, junto com uma noção de ‘crença representacional’. Neste artigo, examino se isso pode ser estendido aos raciocínios e crenças de outras culturas, focando em particular nas crenças de feitiçaria dos Azande. Argumento que tais crenças são similares às crenças teóricas da ciência ocidental, mas que o modo mais apropriado de representar esta última — (...) e portanto também a primeira — é através de estruturas parciais e quase-verdade. Dessa maneira, espero encontrar um caminho plausível entre as abordagens ‘imperialista’ e ‘relativista’. DOI: 10.5007/1808-1711.2011v15n1p77. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

It is a well-known fact that MV-algebras, the algebraic counterpart of Łukasiewicz logic, correspond to a certain type of partial algebras: lattice-ordered effect algebras fulfilling the Riesz decomposition property. The latter are based on a partial, but cancellative addition, and we may construct from them the representing ℓ-groups in a straightforward manner. In this paper, we consider several logics differing from Łukasiewicz logics in that they contain further connectives: the PŁ-, PŁ'-, PŁ'△-, and ŁΠ-logics. For all their (...) algebraic counterparts, we characterise the corresponding type of partial algebras. We moreover consider the representing f-rings. All in all, we get three-fold correspondences: the total algebras - the partial algebras - the representing rings. (shrink)

We give a version of L´os’ ultraproduct result for forcing in Kripke structures in a first-order language with equality and discuss ultrafilters in a topology naturally associated to a partial order. The presentation also includes background material so as to make the exposition accessible to those whose main interest is Computer Science, Artificial Intelligence and/or Philosophy.

In Science and Partial Truth it was argued that inconsistencies in scientific reasoning may be accommodated by the combination of partial structures and quasi-truth, together with a notion of ‘representational belief’. In this paper I shall examine whether this framework can be extended to the reasonings and beliefs of other cultures, focusing in particular on the witchcraft beliefs of Azande. I shall argue that these beliefs are akin to the theoretical beliefs of Western science but that the most (...) appropriate way of representing the latter — and hence also the former — is via the framework of partial structures and quasi-truth. In this way I hope to steer a plausible path between ‘imperialist’ and ‘relativist’ approaches. (shrink)

ABSTRACT We present a new method for proving theorems in the equational theory of partial maps over toposes introduced in the papers [C'089] and [086], The method is given by a system of rules of formation of proofs. The proofs of f is defined' and the proofs of correctness ‘φ)' formed by application of the rules of the system are such that they contain a computation of the value f, where f is a partial function valued in natural (...) numbers and is a vector of natural numbers. We show that the system is complete, i.e. if an equation holds in every model then it has a proof formed by application of the rules of the system. The system is equipped with a method of visual presentation of proofs by nested commutative triangles, i.e. commutative triangles which contain in their interiors other commutative triangles which may be also nested. To provide formal foundations for the method of visual presentation of proofs we give a mathematical description of nested commutative triangles in terms of directed graphs and graph homomorphisms. AMS Subject Classification 1995: Primary: 68. Secondary: 18. (shrink)

A major worry in self-deception research has been the implication that people can hold a belief that something is true and false at the same time: a logical as well as a psychological impossibility. However, if beliefs are held with imperfect confidence, voluntary self-deception in the sense of seeking evidence to reject an unpleasant belief becomes entirely plausible and demonstrably real.

On Friday the 1st and Saturday the 2nd of December 1995, the Sonderforschungsbereich 340 held a workshop entitled Syntax and Semantics of Partial Wh-Movement. This volume contains most of the papers presented there.1 One of the leading ideas underlying the workshop was that detailed investigation of the partial wh-movement construction provides an excellent test ground for checking assumptions about the syntax/semantics interface.

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established.