
37Modal Provability Foundations for Argumentation NetworksStudia Logica 93 (2): 181198. 2009.Given an argumentation network we associate with it a modal formula representing the 'logical content' of the network. We show a onetoone correspondence between all possible complete Caminada labellings of the network and all possible models of the formula

22Applications of Scott's notion of consequence to the study of general binary intensional connectives and entailmentJournal of Philosophical Logic 2 (3). 1973.

19Semantical Investigations in Heyting's Intuitionistic LogicJournal of Symbolic Logic 51 (3): 824824. 1986.

14Fallacies as cognitive virtuesIn Ondrej Majer, AhtiVeikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy, Springer Verlag. pp. 5798. 2009.

88A logical account of formal argumentationStudia Logica 93 (23): 109145. 2009.In the current paper, we reexamine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment

5Algorithms in cognition, informatics and logic: A position manifestoLogic Journal of the IGPL 18 (6): 763768. 2010.

6

9Fibred 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 firstorder 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

2Interactive Logic: Selected Papers From the 7th Augustus de Morgan Workshop, London (edited book)Amsterdam University Press. 2008.This collection of papers from the workshop serves as the initial volume in the new series Texts in Logics and Games—touching on research in logic, mathematics, computer science, and game theory. “A wonderful demonstration of ...

Adding a temporal dimension to a logicJournal of Logic, Language and Information 1 (3): 203233. 1992.

3Reactive Kripke models and contrary to duty obligations. Part A: SemanticsJournal of Applied Logic 11 (1): 103136. 2013.

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): 189202. 1996.

Proof theory for fuzzy logics. Applied Logic Series, vol. 36Bulletin of Symbolic Logic 16 (3): 415419. 2010.

40Handbook of the Logic of Argument and Inference: The Turn Towards the Practical (edited book)Elsevier. 2002.The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a minicourse for interested readers, in deductive and inductive logic, or as a refresher. The…Read more

25Products of modal logics. Part 3: Products of modal and temporal logicsStudia Logica 72 (2): 157183. 2002.In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal nmodal and minimal ntemporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical firstorder logic and of the equational theory of relation algebras, that are decidable and have the finite model property.

9Belief Contraction, Antiformulae and Resource Overdraft: Part I Deletion in Resource Bounded LogicsLogic Journal of the IGPL 10 (6): 601652. 2002.There are several areas in applied logic where deletion from databases is involved in one way or another:Belief contraction Triggers of the form ‘If condition then remove A’, which are extensively used in database management systemsResource considerations as in relevance and linear logics, where addition or removal of resource can affect provabilityFree logic and the like, where existence and nonexistence of individuals affects quantification.All of these areas have certain logical difficulties…Read more

Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1: Logical FoundationsStudia Logica 55 (3): 449451. 1995.

15The Functional Interpretation of the Existential QuantifierLogic Journal of the IGPL 3 (23): 243290. 1995.We are concerned with showing how ‘labelled’ Natural Deduction presentation systems based on an extension of the socalled CurryHoward functional interpretation can help us understand and generalise most of the deduction calculi designed to deal with the logical notion of existential quantification. We present the labelling mechanism for ‘’ using what we call ‘ɛterms’, which have the form of ‘a’) in a dual form to the ‘Ax.f’ terms of in the sense that the ‘witness’ is chosen at the time of ass…Read more

NaturalLanguage Content: A ProofTheoretic PerspectiveIn Proceedings of the Eigth Amsterdam Formal Semantics Colloqium, University of Amsterdam. 1992.

46SecondOrder Quantifier Elimination in HigherOrder Contexts with Applications to the Semantical Analysis of ConditionalsStudia Logica 87 (1): 3750. 2007.Secondorder quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing secondorder variables to appear within higherorder contexts. Then we focus on a semantical analysis of conditio…Read more