-
36Dung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine DaggerLogica Universalis 5 (2): 255-318. 2011.In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ${\neg, \wedge, \vee, \to}$ of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logi…Read more
-
19Łukasiewicz Logic: From Proof Systems To Logic ProgrammingLogic Journal of the IGPL 13 (5): 561-585. 2005.We present logic programming style “goal-directed” proof methods for Łukasiewicz logic Ł that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of Ł with rational constants
-
103Independence — Revision and DefaultsStudia Logica 92 (3): 381-394. 2009.We investigate different aspects of independence here, in the context of theory revision, generalizing slightly work by Chopra, Parikh, and Rodrigues, and in the context of preferential reasoning.
-
36Annotation Theories over Finite GraphsStudia Logica 93 (2): 147-180. 2009.In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph's nodes. Such theories, which we call annotation theories^ can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotati…Read more
-
2Semantical Considerations for Modal Logics by Saul A. KripkeJournal of Symbolic Logic 34 (3): 501-501. 1969.
-
122Roadmap for preferential logicsJournal of Applied Non-Classical Logics 19 (1): 43-95. 2009.We give a systematic overview of semantical and logical rules in non monotonic and related logics. We show connections and sometimes subtle differences, and also compare such rules to uses of the notion of size.
-
32A new version of Beth semantics for intuitionistic logicJournal of Symbolic Logic 42 (2): 306-308. 1977.
-
99What is a logical system? (edited book)Oxford University Press. 1994.This superb collection of papers focuses on a fundamental question in logic and computation: What is a logical system? With contributions from leading researchers--including Ian Hacking, Robert Kowalski, Jim Lambek, Neil Tennent, Arnon Avron, L. Farinas del Cerro, Kosta Dosen, and Solomon Feferman--the book presents a wide range of views on how to answer such a question, reflecting current, mainstream approaches to logic and its applications. Written to appeal to a diverse audience of readers, W…Read more
-
14Fibred Security LanguageStudia Logica 92 (3). 2009.We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language (both for classical and intuitionistic fragment), we then pro…Read more
-
34On Kreisel's notion of validity in post systemsStudia Logica 35 (3). 1976.This paper investigates various interpretations of HPC (Heyting's predicate calculus) and mainly of HPC0 (Heyting's propositional calculus) in Post systems.§1 recalls some background material concerning HPC including the Kripke and Beth interpretations, and later sections study the various interpretations available.
-
43Temporal Logic: Mathematical Foundations and Computational AspectsOxford University Press on Demand. 1994.This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusio…Read more
-
60Extending the Curry-Howard interpretation to linear, relevant and other resource logicsJournal of Symbolic Logic 57 (4): 1319-1365. 1992.
-
14KM99] GP Kogan and JA Makowsky. Computing Schur functions for Borchardt matrices. in preparation, 1999. Kog96] GP Kogan. Computing the permanent over elds of characteristic 3: Where and why it becomes dificult. In FOCS'96, pages 108 {114. IEEE, 1996 (review)Annals of Pure and Applied Logic 78 (2): 189-202. 1996.
-
70Cut and payJournal of Logic, Language and Information 15 (3): 195-218. 2006.In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an approx…Read more
-
61Modal Logics of Reactive FramesStudia Logica 93 (2-3): 405-446. 2009.A reactive graph generalizes the concept of a graph by making it dynamic, in the sense that the arrows coming out from a point depend on how we got there. This idea was first applied to Kripke semantics of modal logic in [2]. In this paper we strengthen that unimodal language by adding a second operator. One operator corresponds to the dynamics relation and the other one relates paths with the same endpoint. We explore the expressivity of this interpretation by axiomatizing some natural subclass…Read more
-
56Two dimensional Standard Deontic Logic [including a detailed analysis of the 1985 Jones–Pörn deontic logic system]Synthese 187 (2): 623-660. 2012.This paper offers a two dimensional variation of Standard Deontic Logic SDL, which we call 2SDL. Using 2SDL we can show that we can overcome many of the difficulties that SDL has in representing linguistic sets of Contrary-to-Duties (known as paradoxes) including the Chisholm, Ross, Good Samaritan and Forrester paradoxes. We note that many dimensional logics have been around since 1947, and so 2SDL could have been presented already in the 1970s. Better late than never! As a detailed case study i…Read more
-
39Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: OverviewStudia Logica 93 (2-3): 357-381. 2009.In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks 6, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics to such networks. We offer three different approaches to obtaining semantics. 1. The translation approach This uses the methodology of ' …Read more
-
42Completeness properties of heyting's predicate calculus with respect to re modelsJournal of Symbolic Logic 41 (1): 81-94. 1976.
-
59Analytic Calculi for Product LogicsArchive for Mathematical Logic 43 (7): 859-889. 2004.Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.
-
11Representation of the Montague Semantics as a Form of the Suppes Semantics with Applications to the Problem of the Introduction of the Passive Voice, the Tenses, and Negation as TransformationsIn Jaakko Hintikka (ed.), Approaches to Natural Language, D. Reidel Publishing. pp. 395--409. 1973.
-
45Algorithmic proof methods and cut elimination for implicational logics part I: Modal implicationStudia Logica 61 (2): 237-280. 1998.In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility.…Read more