Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least as (...) good as their paracomplete counterparts, than giving positive reasons to believe on a particular paraconsistent proposal. But it sometimes happens that the weakness of a theory turns out to be its mayor ally, and this is what (I claim) happens in a particular paraconsistent proposal known as subvaluationism. In order to make room for truth-value gluts subvaluationism needs to endorse a notion of logical consequence that is, in some sense, weaker than standard notions of consequence. But this weakness allows the subvaluationist theory to accommodate higher-order vagueness in a way that it is not available to other theories of vagueness (such as, for example, its paracomplete counterpart, supervaluationism). (shrink)

Basic hybrid logic extends modal logic with the possibility of naming worlds by means of a distinguished class of atoms (called nominals) and the so-called satisfaction operator, that allows one to state that a given formula holds at the world named a, for some nominal a. Hence, in particular, hybrid formulae include “equality” assertions, stating that two nominals are distinct names for the same world. The treatment of such nominal equalities in proof systems for hybrid logics may induce many redundancies. (...) This paper introduces an internalized tableau system for basic hybrid logic, significantly reducing such redundancies. The calculus enjoys a strong termination property: tableau construction terminates without relying on any specific rule application strategy, and no loop-checking is needed. The treatment of nominal equalities specific of the proposed calculus is briefly compared to other approaches. Its practical advantages are demonstrated by empirical results obtained by use of implemented systems. Finally, it is briefly shown how to extend the calculus to include the global and converse modalities. (shrink)

A number of significant contributions in the last four decades show that non-normal modal logics can be fruitfully employed in several applied fields. Well-known domains are epistemic logic, deontic logic, and systems capturing different aspects of action and agency such as the modal logic of agency, concurrent propositional dynamic logic, game logic, and coalition logic. Semantics for such logics are traditionally based on neighbourhood models. However, other model-theoretic semantics can be used for this purpose. Here, we systematically study multi-relational structures, (...) whose investigation is still relatively underdeveloped. After a brief introduction to two different versions of multi-relational semantics – which we call strong and weak multi-relational semantics – we proceed to study several modal schemata. Special attention is paid to the schemata CON and D. Finally we offer completeness proofs for several systems using both strong and weak semantic tools: The proofs thus cover both classical system.. (shrink)

This paper supersedes an ealier version, entitled "A Non-Standard Semantics for Inexact Knowledge with Introspection", which appeared in the Proceedings of "Rationality and Knowledge". The definition of token semantics, in particular, has been modified, both for the single- and the multi-agent case.

We introduce the concept of a connected logic (over S4) and show that each connected logic with the finite model property is the logic of a subalgebra of the closure algebra of all subsets of the real line R, thus generalizing the McKinsey-Tarski theorem. As a consequence, we obtain that each intermediate logic with the finite model property is the logic of a subalgebra of the Heyting algebra of all open subsets of R.

We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...) formal definition, and acknowledge limitations and borderline cases. Throughout we show how awareness of the two stances suggests new logical systems and new issues about translations between implicit and explicit systems, linking up with foundational concerns about identity of logical systems. But we also show how a practical facility with these complementary working styles has philosophical consequences, as it throws doubt on strong philosophical claims made by just taking one design stance and ignoring alternative ones. We will illustrate the latter benefit for the case of logical pluralism and hyper-intensional semantics. (shrink)

This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic analysis and (...) several completeness theorems. We show how our system links up with Von Wright's work, and how it applies to game-theoretic solution concepts, to agenda setting in investigation, and to preference change. We finally consider its relation with infinitary modal logics. (shrink)

We introduce a propositional many-valued modal logic which is an extension of the Continuous Propositional Logic to a modal system. Otherwise said, we extend the minimal modal logic to a Continuous Logic system. After introducing semantics, axioms and deduction rules, we establish some preliminary results. Then we prove the equivalence between consistency and satisfiability. As straightforward consequences, we get compactness, an approximated completeness theorem, in the vein of Continuous Logic, and a Pavelka-style completeness theorem.

The main aim of this paper is to present a way to improve the e.ciency of an intelligent alarm correlation module by means of an abductive reasoner. The alarm correlation module is integrated in a more complex system that performs monitoring and control tasks over a tract of a highway. On the basis of a specific theory on the domain, explanations of anomalous traffic patterns can be provided taking into account those situations not directly detected by data acquisition technology. The (...) integration of the comprehensive view obtained by means of a correlation phase with additional domain knowledge allows to abduce from the observed anomalous traffic patterns other significant situations. The experience of traffic operators allows to build a theory of abducible explanations that exploits the knowledge of the use context of the system. The correlation module of SAMOT has been modelled within a propositional modal language, named ST-Logic, which will be adopted for the abductive reasoner as well. Finally, some remarks about stratified interpretative cycles made possible within such a formal framework will be addressed. (shrink)

We investigate the process of truth-seeking by iterated belief revision with higher-level doxastic information . We elaborate further on the main results in Baltag and Smets (Proceedings of TARK, 2009a , Proceedings of WOLLIC’09 LNAI 5514, 2009b ), applying them to the issue of convergence to truth . We study the conditions under which the belief revision induced by a series of truthful iterated upgrades eventually stabilizes on true beliefs. We give two different conditions ensuring that beliefs converge to “full” (...) (complete) truth , as well as a condition ensuring only that they converge to true (but not necessarily complete) beliefs. (shrink)

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)

This paper defines a Sahlqvist fragment for relevant logic and establishes that each class of frames in the Routley-Meyer semantics which is definable by a Sahlqvist formula is also elementary, that is, it coincides with the class of structures satisfying a given first order property calculable by a Sahlqvist-van Benthem algorithm. Furthermore, we show that some classes of Routley-Meyer frames definable by a relevant formula are not elementary.

(2012). DEL-sequents for regression and epistemic planning. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 337-367. doi: 10.1080/11663081.2012.736703.

We introduce a bimodal epistemic logic intended to capture knowledge as truth in all epistemically alternative states and belief as a generalised ‘majority’ quantifier, interpreted as truth in most of the epistemically alternative states. This doxastic interpretation is of interest in knowledge-representation applications and it also holds an independent philosophical and technical appeal. The logic comprises an epistemic modal operator, a doxastic modal operator of consistent and complete belief and ‘bridge’ axioms which relate knowledge to belief. To capture the notion (...) of a ‘majority’ we use the ‘large sets’ introduced independently by K. Schlechta and V. Jauregui, augmented with a requirement of completeness, which furnishes a ‘weak ultrafilter’ concept. We provide semantics in the form of possible-worlds frames, properly blending relational semantics with a version of general Scott–Montague frames and we obtain soundness and completeness results. We examine the validity of certain epistemic principles discussed in the literature, in particular some of the ‘bridge’ axioms discussed by W. Lenzen and R. Stalnaker, as well as the ‘paradox of the perfect believer’, which is not a theorem of. (shrink)

(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.

We formally introduce a novel, yet ubiquitous, category of norms: norms of instrumentality. Norms of this category describe which actions are obligatory, or prohibited, as instruments for certain purposes. We propose the Logic of Agency and Norms (LAN) that enables reasoning about actions, instrumentality, and normative principles in a multi-agent setting. Leveraging LAN , we formalize norms of instrumentality and compare them to two prevalent norm categories: norms to be and norms to do. Last, we pose principles relating the three (...) categories and evaluate their validity vis-à-vis notions of deliberative acting. On a technical note, the logic will be shown decidable via the finite model property. (shrink)

In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while preserving (...) validity. Last, we discuss problems that arise from employing binary utility functions in a temporal setting. (shrink)

This volume seeks to further the use of formal methods in clarifying one of the central problems of philosophy: that of our free human agency and its place in our indeterministic world. It celebrates the important contributions made in this area by Nuel Belnap, American logician and philosopher. Philosophically, indeterminism and free action can seem far apart, but in Belnap’s work, they are intimately linked. This book explores their philosophical interconnectedness through a selection of original research papers that build forth (...) on Belnap’s logical and philosophical work. Some contributions take the form of critical discussions of Belnap's published work, some develop points made in his publications in new directions, and others provide additional insights on the topics of indeterminism and free action. In Nuel Belnap’s work on indeterminism and free action, three formal frameworks figure prominently: the simple branching histories framework known as "branching time;" its relativistic spatio-temporal extension, branching space-times; and the “seeing to it that” logic of agency. As those frameworks provide the formal background for the contributed papers, the volume introduction gives an overview of the current state of their development. It also introduces case-intensional first order logic, a general intensional logic offering resources for a first-order extension of the mentioned frameworks and a recent research focus of Belnap’s. The volume also contains an extended biographical interview with Nuel Belnap. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...

The notion of validity for modal languages could be defined in two slightly different ways. The first is the original definition given by S. Kripke, for which a formula φ of a modal language L is valid if and only if it is true in every actual world of every interpretation of L. The second is the definition that has become standard in most textbook presentations of modal logic, for which a formula φ of L is valid if and only (...) if it is true in every world in every interpretation of L. For simple modal languages, “Kripkean validity” and “Textbook validity” are extensionally equivalent. According to E. Zalta, however, Textbook validity is an “incorrect” definition of validity, because: (i) it is not in full compliance with Tarski’s notion of truth; (ii) in expressively richer languages, enriched by the actuality operator, some obviously true formulas count as valid only if the Kripkean notion is used. The purpose of this paper is to show that (i) and (ii) are not good reasons to favor Kripkean valid- ity over Textbook validity. On the one hand, I will claim that the difference between the two should rather be seen as the result of two different conceptions on how a modal logic should be built from a non-modal basis; on the other, I will show the advantages, for the question at issue, of seeing the actuality operator as belonging to the family of two-dimensional operators. (shrink)

The aim of this paper is to provide an intuitive semantics for systems of justification logic which allows us to cope with the distinction between implicit and explicit justifiers. The paper is subdivided into three sections. In the first one, the distinction between implicit and explicit justifiers is presented and connected with a proof-theoretic distinction between two ways of interpreting sequences of sentences; that is, as sequences of axioms in a certain set and as sequences proofs constructed from that set (...) of axioms. In the second section, a basic system of justification logic for implicit and explicit justifiers is analyzed and some significant facts about it are proved. In the final section, an adequate semantics is proposed, and the system is proved to be sound and complete whit respect to it. (shrink)