ABSTRACT What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic (ICL), compare it with partial logic, and give the resolution method for it. We will also show how ICL can be applied to nonmonotonic reasoning. We define nonmonotonic derivation as (...) monotonic derivation in ICL from the database and some consistent assumptions. The mechanism of ICL makes it easy to assert the consistency of an assumption without asserting the assumption itself. (shrink)

We prove that for any finite deduction structure there exists a unique concise-widest chain-preserved split. Based on this result, we propose a logical splitting strategy which enables an agent to split its belief structure such that all the original inference chains can be preserved. The significance of such logical splitting at least is four-fold: It can be used by an agent to separate its concerns appropriately, or even create smaller and smarter clones which could save time and efforts in their (...) deliberation computing; It will enable an agent to adjust its concerns dynamically based on its recognition of the current situation, which may further enable the agent to make rapid and rational decisions when situation shifting occurs; In periodic team synchronization domains where agents can periodically synchronize their behaviors with no restriction on communication, it can be employed as a critical process for maintaining the shared mental models among a team of agents; and It is helpful in alleviating the complexity of reasoning about relevant information, and in better anticipating both explicit and implicit information needs based on the recognition of the current situation. (shrink)

The biennial DEON conferences are designed to promote interdisciplinary cooperation amongst scholars interested in linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, linguistics, philosophy, organization theory and law. In addition to these general themes, DEON 2016 encouraged a special focus on the topic "Reasons, Argumentation and Justification.".

The well known AGM framework for belief revision has recently been extended to include a model of the research agenda of the agent, i.e. a set of questions to which the agent wishes to find answers (Olsson & Westlund in Erkenntnis , 65 , 165–183, 2006 ). The resulting model has later come to be called interrogative belief revision . While belief revision has been studied extensively from the point of view of modal logic, so far interrogative belief revision has (...) only been dealt with in the metalanguage approach in which AGM was originally presented. In this paper, I show how to model interrogative belief revision in a modal object language using a class of operators for questions. In particular, the solution I propose will be shown to capture the notion of K-truncation , a method for agenda update in the case of expansion constructed by Olsson & Westlund. Two case studies are conducted: first, an interrogative extension of Krister Segerberg’s system DDL, and then a similar extension of Giacomo Bonanno’s modal logic for belief revision. Sound and complete axioms will be provided for both of the resulting logics. (shrink)

We study modal logics based on neighbourhood semantics using methods and theorems having their origin in topological model theory. We thus obtain general results concerning completeness of modal logics based on neighbourhood semantics as well as the relationship between neighbourhood and Kripke semantics. We also give a new proof for a known interpolation result of modal logic using an interpolation theorem of topological model theory.

This paper arose out of the 2017 international conference on AI and law doctoral consortium. There were five students who presented their Ph.D. work, and each of them has contributed a section to this paper. The paper offers a view of what topics are currently engaging students, and shows the diversity of their interests and influences.

We give a set of postulates for the minimal normal modal logicK + without negation or any kind of implication. The connectives are simply , , , . The postulates (and theorems) are all deducibility statements . The only postulates that might not be obvious are.

Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goal to achieve, and in which agents must typically cooperate with others in order to satisfy their goals. In this paper, we show how it is possible to reason about QCGs using Coalition Logic (CL), a formalism intended to facilitate reasoning about coalitional powers in game-like multiagent systems. We introduce a correspondence relation (...) between QCGs and interpretations for CL, which defines the circumstances under which a CL interpretation correctly characterises a QCG. The complexity of deciding correspondence between QCGs and interpretations for CL is shown to vary from being tractable up to Πp 2-complete, depending on the representation chosen for the QCG and interpretation. We then show how various properties and solution concepts of QCGs can be characterised as CL formula schemes. The ideas are illustrated via a detailed worked example, in which we demonstrate how a model checker can be deployed to investigate whether a particular system has the properties in question. (shrink)

Many philosophers are convinced that rationality dictates that one’s overall set of intentions be consistent. The starting point and inspiration for our study is Bratman’s planning theory of intentions. According to this theory, one needs to appeal to the fulfilment of characteristic planning roles to justify norms that apply to our intentions. Our main objective is to demonstrate that one can be rational despite having mutually inconsistent intentions. Conversely, it is also shown that one can be irrational despite having a (...) consistent overall set of intentions. To overcome this paradox, we argue that it is essential for a successful planning system that one’s intentions are practically consistent rather than being consistent or applying an aggregation procedure. Our arguments suggest that a new type of norm is needed: whereas the consistency requirement focuses on rendering the contents of one’s intentions consistent, our new practical consistency requirement demands that one’s intentions be able to simultaneously and unconditionally guide one’s action. We observe that for intentions that conform to the ‘own-action condition’, the practical consistency requirement is equivalent to the traditional consistency requirement. This implies that the consistency requirement only needs to be amended in scenarios of choice under uncertainty. (shrink)

The starting point of this work is the gap between two distinct traditions in information engineering: knowledge representation and data - driven modelling. The first tradition emphasizes logic as a tool for representing beliefs held by an agent. The second tradition claims that the main source of knowledge is made of observed data, and generally does not use logic as a modelling tool. However, the emergence of fuzzy logic has blurred the boundaries between these two traditions by putting forward fuzzy (...) rules as a Janus-faced tool that may represent knowledge, as well as approximate non-linear functions representing data. This paper lays bare logical foundations of data - driven reasoning whereby a set of formulas is understood as a set of observed facts rather than a set of beliefs. Several representation frameworks are considered from this point of view: classical logic, possibility theory, belief functions, epistemic logic, fuzzy rule-based systems. Mamdani's fuzzy rules are recovered as belonging to the data - driven view. In possibility theory a third set-function, different from possibility and necessity plays a key role in the data - driven view, and corresponds to a particular modality in epistemic logic. A bi-modal logic system is presented which handles both beliefs and observations, and for which a completeness theorem is given. Lastly, our results may shed new light in deontic logic and allow for a distinction between explicit and implicit permission that standard deontic modal logics do not often emphasize. (shrink)

We propose a new formalization of legal competences, and in particular for the Hohfeldian categories of power and immunity, through a deontic reinterpretation of dynamic epistemic logic. We argue that this logic explicitly captures the norm-changing character of legal competences while providing a sophisticated reduction of the latter to static normative positions. The logic is completely axiomatizable, and we apply it to a concrete case in German contract law to illustrate that it can capture the distinction between legal ability and (...) legal permissibility. (shrink)

This paper, a sequel to Models for normal intuitionistic modal logics by M. Boi and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of S4 and S5. For these prepositional logics Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given, and soundness and completeness are proved with respect to these models. It is shown how the holding of (...) formulae characteristic for particular logics is equivalent to conditions for the relations of the models. Modalities in these logics are also investigated. (shrink)

This paper presents duality results between categories of neighbourhood frames for modal logic and categories of modal algebras (i.e. Boolean algebras with an additional unary operation). These results extend results of Goldblatt and Thomason about categories of relational frames for modal logic.

This paper argues that there are true synthetic modal claims and that modal questions in philosophy in general are to be interpreted not in terms of logical necessity but in terms of synthetic necessity. I begin by sketching the debate about modality between logical positivism and phenomenology. Logical empiricism taught us to equate being tautological with being necessary. The common view is that tautologies are necessary in the narrow sense but that there is also necessity in a wider sense. I (...) argue against this that we should distinguish necessity from analyticity and possibility from consistency. (shrink)

Když jsem v roce 1992 začínal na filosofické fakultě UK přednášet teorii sémantiky, cítil jsem intenzivní potřebu poskytnout studentům nějaký učební text. O překotném vývoji tohoto interdisciplinárního oboru, který odstartovalo v sedmdesátých letech úspěšné “zkřížení logiky s lingvistikou” Richardem Montaguem a dalšími a který se nezpomalil dodnes, totiž v češtině neexistovaly prakticky žádné zprávy (s čestnou výjimkou přístupu tzv. transparentní intenzionální logiky, který byl dílem českého emigranta Pavla Tichého a o kterém u nás psal Pavel Materna). Přehledové publikace, jaké jsou (...) potřeba pro někoho, kdo se chce v dané problematice zorientovat, se ovšem v té době i po světě teprve začínaly objevovat: v roce 1990 vyšla kniha An Introduction to Semantics Gennara Chierchii a Sally McConell-Ginnetové a v roce 1991 vydala skupina holandských logiků pod kolektivním pseudonymem L.T.F. Gamut dvousvazkovou knihu Language and Meaning. Za této situace jsem se pokusil co nejrychleji sepsat učební text, který by moji studenti i jiní zájemci o sémantiku mohli použít; a protože o jeho vydání paradoxně projevila větší zájem filosofická fakulta Masarykovy univerzity v Brně (kde jsem já osobně nikdy neučil; ale zájem o sémantiku tam neúnavně podněcoval a vydání mého textu tam zprostředkoval kolega Materna) než filosofická fakulta mojí domovské Karlovy univerzity, vyšel tento text v Brně, a to pod názvem Úvod do teoretické sémantiky. (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 ...

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

This volume presents mathematical game theory as an interface between logic and philosophy.

Formal learning theory is the mathematical embodiment of a normative epistemology. It deals with the question of how an agent should use observations about her environment to arrive at correct and informative conclusions. Philosophers such as Putnam, Glymour and Kelly have developed learning theory as a normative framework for scientific reasoning and inductive inference.

Epistemic logic is the logic of knowledge and belief. It provides insight into the properties of individual knowers, has provided a means to model complicated scenarios involving groups of knowers and has improved our understanding of the dynamics of inquiry.

The deontic modal must has two surprising properties: an assertion of must p does not permit a denial of p, and must does not take past tense complements. I first consider an explanation of these phenomena that stays within Angelika Kratzer’s semantic framework for modals, and then offer some reasons for rejecting that explanation. I then propose an alternative account, according to which simple must sentences have the force of an imperative.

The aim of this dissertation is to provide support for the following claim: if Hanks’ theory of propositions as act-types is correct, then there exists a plausible extension of this theory that solves the Frege-Geach problem for normative propositions. I assume that Hanks’ theory is correct, and in this framework develop an account of semantic expressivism that addresses three versions of the Frege-Geach problem: the embedding, inference and negation problems. First, I examine in detail one existing attempt to support the (...) claim, due to Hom and Schwartz. I argue that their extension is not plausible for two reasons: it does not satisfy a key expressivist constraint, and it encounters a problem with interrogatives. Then I argue that even if their extension were plausible, it would not solve the embedding problem for conditionals, for two reasons: it does not place suitable constraints on applications of force-indicators, and it encounters a problem with mixed descriptive-normative conditionals. Second, I give a new extension of Hanks’ theory for atomic normative sentences, and argue that it is plausible. Then I extend it further by defining force-indicators that are generalizations of assertion and of normative endorsement (and of denial and anti-endorsement) and by defining logical relations that apply uniformly to as- sertive and normative propositions. I argue that this extension provides a neutral logical framework within which the embedding, inference and negation problems for normative propositions can be more effectively addressed. (shrink)

Classical modal logics, based on the neighborhood semantics of Scott and Montague, provide a generalization of the familiar normal systems based on Kripke semantics. This paper defines AGM revision operators on several first-order monotonic modal correspondents, where each first-order correspondence language is defined by Marc Pauly’s version of the van Benthem characterization theorem for monotone modal logic. A revision problem expressed in a monotone modal system is translated into first-order logic, the revision is performed, and the new belief set is (...) translated back to the original modal system. An example is provided for the logic of Risky Knowledge that uses modal AGM contraction to construct counter-factual evidence sets in order to investigate robustness of a probability assignment given some evidence set. A proof of correctness is given. (shrink)

In this thesis, I develop a nonreductive and general conception of potentiality, and explore the prospects of a realist account of possibility based on this account of potentiality. Potentialities are properties of individual objects; they include dispositions such as fragility and abilities such as the ability to play the piano. Potentialities are individuated by their manifestation alone. In order to provide a unified account of potentialities, I argue in chapter 2 that dispositions, contrary to philosophical orthodoxy, are best understood in (...) terms only of their manifestations (as disposi- tions to ...), rather than in terms of a stimulus and a manifestation condition (as dispositions to ... if ...). Chapter 3 provides some preliminary motivation for a nonreductive and gen- eral account of potentiality, and chapter 4 develops such an account. The guiding question is how far the notion of potentiality can be extended from the initial ex- amples of familiar dispositions and abilities, and it is argued that it can be extended very far. Various features of potentialities are explored, among them extrinsicality, iterations of potentiality, and the behaviour of potentiality with regard to logical equivalence. In chapter 5, the account is set to work in providing the outlines and a defense of a potentiality-based account of possibility. The basic idea of such an account is that it is possible that p just in case some thing has a potentiality for p. The account is defended against the objection that there may not be enough potential- ities to ground all the possibilities that there are. Finally, in chapter 6, a logic of potentiality is formulated and the logic of possibility derived from it, showing that the potentiality-based account of possibility is formally adequate: it provides pos- sibility with the formal features that modal logicians have studied. I conclude that the proposed account of possibility is a promising research programme. (shrink)

cal practice: the enterprise of specifying information about the world for use in computer systems. Knowledge representation as a field also encompasses conceptual results that call practitioners’ attention to important truths about the world, mathematical results that allow practitioners to make these truths precise, and computational results that put these truths to work. This chapter surveys this practice and its results, as it applies to the interpretation of natural language utterances in implemented natural language processing systems. For a broader perspective (...) on such technical practice, in all its strengths and weaknesses, see (Agre 1997). Knowledge representation offers a powerful general tool for the science of language. Computational logic, a prototypical formalism for representing knowledge about the world, is also the model for the level of logical form that linguists use to characterize the grammar of meaning (Larson and Segal 1995). And researchers from (Schank and Abelson 1977) to (Shieber 1993) and (Bos to appear) have relied crucially on such representations, and the inference methods associated with them, in articulating accounts of semantic relations in language, such as synonymy, entailment, informativeness and contradiction. The new textbooks (Blackburn and Bos 2002a, Blackburn and Bos 2002b) provide an excellent grounding in this research, and demonstrate how deeply computational ideas from knowledge representation can inform pure linguistic study. In this short chapter, I must leave much of.. (shrink)

Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.

One main goal of argumentation theory is to evaluate arguments and to determine whether they should be accepted or rejected. When there is no clear answer, a third option, being undecided, has to be taken into account. Indecision is often not considered explicitly, but rather taken to be a collection of all unclear or troubling cases. However, current philosophy makes a strong point for taking indecision itself to be a proper object of consideration. This paper aims at revealing parallels between (...) the findings concerning indecision in philosophy and the treatment of indecision in argumentation theory. By investigating what philosophical forms and norms of indecision are involved in argumentation theory, we can improve our understanding of the different uncertain evidential situations in argumentation theory. (shrink)

Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. As (...) Humberstone notes, the issue of Post completeness in congruential modal logics is not well understood. The present article shows that in contrast to normal modal logics, the extent of the property of Post completeness among congruential modal logics depends on the background set of logics. Some basic results on the corresponding properties of Post completeness are established, in particular that although a congruential modal logic is Post complete among all modal logics if and only if its modality is truth-functional, there are continuum many modal logics Post complete among congruential modal logics. (shrink)

Overview of fundamental work in deontic logic.

Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) dynamical scenario. These are preliminaries results of a wider project on Paraconsistent Belief Change conduced by the authors. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

The article develops a correctness theory of truth (CTT) for semantic information. After the introduction, in section two, semantic information is shown to be translatable into propositional semantic information (i). In section three, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in section four, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. (...) This completes the reduction of the truth of i to the correctness of A. In sections five and six, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates (in a Fregean sense) Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. The last section draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. (shrink)

Philosophical work on free will, contemporary as well as historical, is inevitably framed by the problem of free will and determinism. One of my goals in what follows is to give a feel for the main lines of that debate in philosophy today. I will also be outlining a particular perspective on free will. Many working philosophers consider themselves Compatibilists; the perspective outlined, building on a number of arguments in the recent literature, is a contemporary form of such a view. (...) It cannot, however, claim to be the contemporary philosophical perspective. There is no such thing. Against a background of the perennial problem of free will and determinism, through ongoing argument and debate, philosophers continue to try to work toward an understanding of precisely what it means for an action to be free. (shrink)

Possible worlds models of belief have difficulties accounting for unawareness, the inability to entertain (and hence believe) certain propositions. Accommodating unawareness is important for adequately modelling epistemic states, and representing the informational content to which agents have in principle access given their explicit beliefs. In this paper, I develop a model of explicit belief, awareness, and informational content, along with an sound and complete axiomatisation. I furthermore defend the model against the seminal impossibility result of Dekel, Lipman and Rustichini, according (...) to which three intuitive conditions preclude non-trivial unawareness on any possible worlds model of belief. (shrink)

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".

The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a specific sequence of (...) reduction - the worst reduction sequence - it is the lowest upper bound on the length of reduction sequences. The main commitment of the introduced method is that it is constructive and elementary, produced only through analyzing structural and combinatorial properties of derivations and lambda terms, without appeal to any sophisticated mathematical tool. Together with the exposition of the method, it is presented a comparative study of some articles in the literature that also get strong normalization by means we can identify with the natural ordinal methods. Among them we highlight Howard[1968], which performs an ordinal analysis of Godel’s Dialectica interpretation for intuitionistic first order arithmetic. We reveal a fact about this article not noted by the author himself: a syntactic proof of strong normalization theorem for the system of typified lambda calculus λ⊃ is a consequence of its results. This would be the first strong normalization proof in the literature. (written in Portuguese). (shrink)

Critical examination of Alchourrón and Bulygin’s set-theoretic definition of normative system shows that deductive closure is not an inevitable property. Following von Wright’s conjecture that axioms of standard deontic logic describe perfection-properties of a norm-set, a translation algorithm from the modal to the set-theoretic language is introduced. The translations reveal that the plausibility of metanormative principles rests on different grounds. Using a methodological approach that distinguishes the actor roles in a norm governed interaction, it has been shown that metanormative principles (...) are directed second-order obligations and, in particular, that the requirement related to deductive closure is directed to the norm-applier role rather than to the norm-giver role. The approach has been applied to the case of pure derogation yielding a new result, namely, that an independence property is a perfection-property of a norm-set in view of possible derogation. This paper in a polemical way touches upon several points raised by Kristan in his recent paper. (shrink)

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)