PUBLICATIONS OF CECYLIA RAUSZER

Size: px
Start display at page:

Download "PUBLICATIONS OF CECYLIA RAUSZER"

Transcription

1 PUBLICATIONS OF CECYLIA RAUSZER [CR1] Representation theorem for semi-boolean algebras I, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 19(1971), [CR2] Representation theorem for semi-boolean algebras II, Bull. Acad. Polon. Sci., Ser. Sci. Math. Astronom. Phys. 19(1971), [CR3] A formalization of propositional calculus of H-B logic, Studia Logica 33(1974), [CR4] Semi-boolean algebras and their applications to intuitionistic logic with dual operations, Fund. Math. 85(1974), [CR5] (with B. Sabalski) Representation theorem for distributive pseudoboolean algebras, Bull. of the Sec. of Logic 3(3/4), (1974), [CR6] Remarks on distributive pseudo-boolean algebras, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 23(1975), [CR7] Notes on the Rasiowa-Sikorski Lemma, Studia Logica 34 (1975), [CR8] On the strong semantical completeness of H-B predicate calculus, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 24(1976), [CR9] Craig interpolation theorem for an extension of intuitionistic logic, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 25(1977), [CR10] Model theory for an extension of intuitionistic logic, Studia Logica 36(1977), [CR11] Some remarks on model theory for an extension of intuitionistic logic (abstract), J. Symbolic Logic 42(1997), 467. [CR12] An algebraic approach to the Heyting-Brouwer predicate calculus, Fund. Math. 96(1977), [CR13] Applications of Kripke models to Heyting-Brouwer logic, Studia Logica 36(1977), [CR14] Research work of Andrzej Mostowski in Logical Calculi, In: A. Mostowski: Foundational Studies, Selected Works, PWN 1979, (eds.) K. Kuratowski, W. Marek, L. Pacholski, H. Rasiowa, Cz. Ryll-Nardzewski, P. Zbierski, XLI XLIV. 134

2 [CR15] Model theory for intuitionistic logic (abstract), J. Symbolic Logic 44(1979), 459. [CR16] An algebraic and Kripke-style approach to a certain extension of intuitionistic logic, Dissertationes Math. 157(1980), [CR17] (with A. Jankowski) Logical foundation approach to user s domain restriction in data bases, ICS PAS Reports No 418, Prace Instytutu Podstaw Informatyki PAN, Warszawa [CR18] (with H. Ono) On algebraic and Kripke semantics for intermediate logics In: Universal Algebra and Applications, Series of Banach Center Publications 9, PWN Warszawa 1982, [CR19] Gentzen-style axiomatization for some intermediate logic, Proceedings of the 6-th Latin American Symposium on the Mathematical Logic, Caracas [CR20] (with A. Jankowski) On logical foundation approach to users domain restriction in data bases I, ICS PAS Reports No 494, Prace Instytutu Podstaw Informatyki PAN, Warszawa [CR21] (with A. Jankowski) Logical foundation approach to user s domain restriction in data bases, Theoret. Comput. Sci., 23 (1983), [CR22] On a certain cut-free axiomatization of some intermediate logic (abstract), J. Symbolic Logic 49(1984), 703. [CR23] Some problems on intermediate predicate logic (abstract), J. Symbolic Logic 49(1984), [CR24] Algebraic and logical description of functional and multivalued dependencies, Department of Computer Science, University of Kentucky, Lexington 1984, [CR25] Selected problems of computerization in the cane sugar production, Publications of United Nations Industrial Development Organization [CR26] (with Z. Pawlak) Dependency of attributes in information systems, Bull. Polish Acad. Sci. Math., 33(1985), [CR27] Algebraic properties of functional dependencies, Bull. Polish Acad. Sci. Math., 33(1985), [CR28] An equivalence between theory of functional dependencies and a fragment of intuitionistic logic, Bull. Polish Acad. Sci. Math. 33(1985),

3 [CR29] Remarks on logic for dependencies, Bull. Polish Acad. Sci. Math. 34(1985), [CR30] An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic, Proceedings of the Fifth Conference on Computation Theory, Zaborów, December 1984, Lecture Notes in Computer Science 208, (ed.) A.Skowron, Springer- Verlag, Berlin 1985, [CR31] An algebraic and logical approach to indiscernibility relations, ICS PAS Reports No 559, Prace Instytutu Podstaw Informatyki PAN, Warszawa [CR32] A logic for indiscernibility relations, Proceedings of the Conference on Information Sciences and Systems, Princeton University 1986, [CR33] (with W. Marek) Query optimization in the database distributed by means of product of equivalence relations, Proc. of the Workshop on Deductive Databases and Programming Languages, Washington 1986, also in: Fund. Inform. 11(1988), [CR34] Algebraic and logical description of functional and multivalued dependencies, Proc. of the Second International Symposium on Methodologies for Intelligent Systems, Colloquia Program, (eds.) Z. Ras, M. Emrich, A. Jankowski, Oak Ridge National Laboratory, ORNL- 6417, [CR35] On stable autoepistemic theories, in: Proc. of the Third International Symposium on Methodologies for Intelligent Systems, (eds.) Z. Ras, L. Saitta, North Holland, 1988, [CR36] Stable autoepistemic theories (abstract), J. Symbolic Logic 55 (1990), p [CR37] Expansions and models of autoepistemic theories, 4th Workshop, CSL 90, Heidelberg, October 1 5, 1990, Lecture Notes in Computer Science 533, Springer-Verlag, Berlin 1991, [CR38] On certain stable constructions, Proc. of the Poster Session of the Fifth International Symposium on Methodologies for Intelligent Systems, ICAT, UT-Knoxville, 1990, [CR39] Reducts in information systems, Fund. Inform. 15(1991), [CR40] Algebraic considerations of autoepistemic logic, Fund. Inform. 15(1991), [CR41] Logic for information systems, Fund. Inform. 16(1992),

4 [CR42] Dependencies in relational databases. Algebraic and logical approach, Fund. Inform. 19(1993), [CR43] (with A. Skowron) The discernibility matrices and functions in information systems, In: Intelligent Decision Support. Handbook of Applications and Advances in the Rough Set Theory, (ed.) R. S lowiński, Kluwer, Dordrecht 1992, [CR44] Distributive knowledge representation systems, Foundations of Computing and Decision Sciences, 18(1993), [CR45] Communication systems in distributed information systems, Proc. of the Conf. Intelligent Information Systems, Augustów, June 7 11, 1993, [CR46] Approximation methods for knowledge representation systems, Proc. of the 7-th International Symposium on Methodologies for Intelligent Systems (eds.) J. Komorowski, Z. Ras, Lecture Notes in Computer Science vol. 689 (1993), [CR47] Rough logic for multiagent systems, In: Knowledge Representation and Reasoning under Uncertainty. Logic at Work, (eds.) M. Masuch, L. Polos, Lecture Notes in Artificial Intelligence vol. 808, 1994, , also in: ICS Research Report 27/93, Warsaw University of Technology 1993, [CR48] Knowledge representation systems for groups of agents, In: Philosophical Logic in Poland, (eds.) J. Wroński, Kluwer, Dordrecht 1994, [CR49] (with H. de Swart) Different Approaches to Knowledge, Common Knowledge and Aumann s Theorem, In: Knowledge and Belief in Philosophy and Artificial Intelligence, (eds.) A. Laux, H. Wansing, Berlin, Akademie Verlag

5 Editorial Works of Cecylia Rauszer [CR50] (ed.) (with W. Guzicki, W. Marek, A. Pelc) Proceedings of the Conference: Open Days in Model Theory and Set Theory, University of Leeds, [CR51] (ed.) Algebraic Logic and Its Applications (special issue), Fund. Inform. 18(1993). [CR52] (ed.) Algebraic Methods in Logic and Computer Science, Banach Center Publications, Polish Academy of Sciences, Institute of Mathematics, Warszawa Popular Scientific Works of Cecylia Rauszer [CR53] Logic from the point of view of mathematics (in Polish), Problemy no 1(1976), [CR54] (with A. Romanowska, T. Traczyk) Algebraic semester in Banach Center (in Polish), Wiadom. Mat. 22(1980), [CR55] Mathematical miscellany, (in Polish) Nasza Ksiȩgarnia, Warszawa 1980, second edition [CR56] Mathematical logic (in Polish), In: Leksykon Matematyczny, (eds.) M. Kordos, W. Zawadowski, M. Skwarczyński, Wiedza Powszechna, Warszawa 1993,

1. A motivation for algebraic approaches to logics

1. A motivation for algebraic approaches to logics Andrzej W. Jankowski AN ALGEBRAIC APPROACH TO LOGICS IN RESEARCH WORK OF HELENA RASIOWA AND CECYLIA RAUSZER 1. A motivation for algebraic approaches to logics To realize the importance of the research

More information

1) Totality of agents is (partially) ordered, with the intended meaning that t 1 v t 2 intuitively means that \Perception of the agent A t2 is sharper

1) Totality of agents is (partially) ordered, with the intended meaning that t 1 v t 2 intuitively means that \Perception of the agent A t2 is sharper On reaching consensus by groups of intelligent agents Helena Rasiowa and Wiktor Marek y Abstract We study the problem of reaching the consensus by a group of fully communicating, intelligent agents. Firstly,

More information

POLISH ACADEMY OF SCIENCES INSTITUTE OF MATHEMATICS BANACH CENTER. Publications VOLUME 28. Algebraic Methods in Logic and in Computer Science

POLISH ACADEMY OF SCIENCES INSTITUTE OF MATHEMATICS BANACH CENTER. Publications VOLUME 28. Algebraic Methods in Logic and in Computer Science POLISH ACADEMY OF SCIENCES INSTITUTE OF MATHEMATICS BANACH CENTER Publications VOLUME 28 Algebraic Methods in Logic and in Computer Science WARSZAWA 1993 ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE

More information

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 11. Introduction to Intuitionistic Logic CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated

More information

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Joanna Golińska-Pilarek National Institute of Telecommunications, Warsaw, J.Golinska-Pilarek@itl.waw.pl We will present complete and

More information

PUBLICATIONS OF HELENA RASIOWA

PUBLICATIONS OF HELENA RASIOWA PUBLICATIONS OF HELENA RASIOWA [HR1] Axiomatisation d un système partiel de la theorie de la deduction, Comptes-Rendues de la Soc. de Sci. et de Lettres de Varsovie, C1 III (1947), 22 37. [HR2] Sur certaines

More information

In memory of Wim Blok

In memory of Wim Blok In memory of Wim Blok This Special Issue of Reports on Mathematical Logic is dedicated to the memory of the Dutch logician Willem Johannes Blok, who died in an accident on November 30, 2003. This was an

More information

1. Algebra H-B-M-S- <A, 0, 1,,,,,, >

1. Algebra H-B-M-S- <A, 0, 1,,,,,, > Bulletin of the Section of Logic Volume 17:3/4 (1988), pp. 127 133 reedition 2005 [original edition, pp. 127 137] Alexander S. Karpenko ALGEBRAIC STRUCTURE OF THE TRUTH-VALUES FOR L ω This paper is an

More information

HELENA RASIOWA AND CECYLIA RAUSZER RESEARCH ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE

HELENA RASIOWA AND CECYLIA RAUSZER RESEARCH ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE HELENA RASIOWA AND CECYLIA RAUSZER RESEARCH ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE Zdzislaw Pawlak Institute of Computer Science Warsaw University of Technology ul. Nowowiejska 15/19, 00 665 Warsaw

More information

Seminar I Boolean and Modal Algebras

Seminar I Boolean and Modal Algebras Seminar I Boolean and Modal Algebras Dana S. Scott University Professor Emeritus Carnegie Mellon University Visiting Scholar University of California, Berkeley Visiting Fellow Magdalen College, Oxford

More information

Variations of non-additive measures

Variations of non-additive measures Variations of non-additive measures Endre Pap Department of Mathematics and Informatics, University of Novi Sad Trg D. Obradovica 4, 21 000 Novi Sad, Serbia and Montenegro e-mail: pape@eunet.yu Abstract:

More information

Many-Valued Non-Monotonic Modal Logics

Many-Valued Non-Monotonic Modal Logics Many-Valued Non-Monotonic Modal Logics Melvin Fitting mlflc@cunyvm.cuny.edu Dept. Mathematics and Computer Science Lehman College (CUNY), Bronx, NY 10468 Depts. Computer Science, Philosophy, Mathematics

More information

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically

More information

On Urquhart s C Logic

On Urquhart s C Logic On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced

More information

ON CARDINALITY OF MATRICES STRONGLY ADEQUATE FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC

ON CARDINALITY OF MATRICES STRONGLY ADEQUATE FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC Bulletin of the Section of Logic Volume 3/1 (1974), pp. 34 38 reedition 2012 [original edition, pp. 34 40] Andrzej Wroński ON CARDINALITY OF MATRICES STRONGLY ADEQUATE FOR THE INTUITIONISTIC PROPOSITIONAL

More information

Fuzzy Modal Like Approximation Operations Based on Residuated Lattices

Fuzzy Modal Like Approximation Operations Based on Residuated Lattices Fuzzy Modal Like Approximation Operations Based on Residuated Lattices Anna Maria Radzikowska Faculty of Mathematics and Information Science Warsaw University of Technology Plac Politechniki 1, 00 661

More information

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic

More information

Dimiter Vakarelov SELECTED PUBLICATIONS [1] L. Maksimova and D. Vakarelov, Representation theorem for generalized Post algebras of order ω+. Bull.

Dimiter Vakarelov SELECTED PUBLICATIONS [1] L. Maksimova and D. Vakarelov, Representation theorem for generalized Post algebras of order ω+. Bull. Dimiter Vakarelov SELECTED PUBLICATIONS [1] L. Maksimova and D. Vakarelov, Representation theorem for generalized Post algebras of order ω+. Bull. Acad. Polon. Sci. Ser. Math. Phis., 22(1974), 757-764.

More information

ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS

ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS Takao Inoué ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS 1. Introduction It is well-known that Gentzen s sequent calculus LK enjoys the so-called subformula property: that is, a proof

More information

A remark on predicate extensions of intuitionistic logic

A remark on predicate extensions of intuitionistic logic A remark on predicate extensions of intuitionistic logic Nobu-Yuki Suzuki 1 Department of Mathematics, Faculty of Science, Shizuoka University Second Workshop on Mathematical Logic and its Applications

More information

Proof-Theoretic Analysis of the Quantified Argument Calculus

Proof-Theoretic Analysis of the Quantified Argument Calculus Proof-Theoretic Analysis of the Quantified Argument Calculus Edi Pavlovic Central European University, Budapest #IstandwithCEU PhDs in Logic IX May 2-4 2017, RUB Edi Pavlovic (CEU) Proof-Theoretic Analysis

More information

Rough Sets, Rough Relations and Rough Functions. Zdzislaw Pawlak. Warsaw University of Technology. ul. Nowowiejska 15/19, Warsaw, Poland.

Rough Sets, Rough Relations and Rough Functions. Zdzislaw Pawlak. Warsaw University of Technology. ul. Nowowiejska 15/19, Warsaw, Poland. Rough Sets, Rough Relations and Rough Functions Zdzislaw Pawlak Institute of Computer Science Warsaw University of Technology ul. Nowowiejska 15/19, 00 665 Warsaw, Poland and Institute of Theoretical and

More information

Knowledge Discovery. Zbigniew W. Ras. Polish Academy of Sciences, Dept. of Comp. Science, Warsaw, Poland

Knowledge Discovery. Zbigniew W. Ras. Polish Academy of Sciences, Dept. of Comp. Science, Warsaw, Poland Handling Queries in Incomplete CKBS through Knowledge Discovery Zbigniew W. Ras University of orth Carolina, Dept. of Comp. Science, Charlotte,.C. 28223, USA Polish Academy of Sciences, Dept. of Comp.

More information

On Refutation Rules. Tomasz Skura. 1. Introduction. Logica Universalis

On Refutation Rules. Tomasz Skura. 1. Introduction. Logica Universalis Log. Univers. 5 (2011), 249 254 c 2011 The Author(s). This article is published with open access at Springerlink.com 1661-8297/11/020249-6, published online October 2, 2011 DOI 10.1007/s11787-011-0035-4

More information

Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE. Zdzislaw Pawlak

Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE. Zdzislaw Pawlak Computational Intelligence, Volume, Number, VAGUENES AND UNCERTAINTY: A ROUGH SET PERSPECTIVE Zdzislaw Pawlak Institute of Computer Science, Warsaw Technical University, ul. Nowowiejska 15/19,00 665 Warsaw,

More information

Rough operations on Boolean algebras

Rough operations on Boolean algebras Rough operations on Boolean algebras Guilin Qi and Weiru Liu School of Computer Science, Queen s University Belfast Belfast, BT7 1NN, UK Abstract In this paper, we introduce two pairs of rough operations

More information

SLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION

SLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION Bulletin of the Section of Logic Volume 39:3/4 2010, pp. 161 173 M. Spinks and R. Veroff SLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION Abstract In [19] Slaney et al. introduced a little known

More information

On the Structure of Rough Approximations

On the Structure of Rough Approximations On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study

More information

arxiv: v1 [math.lo] 8 Mar 2018

arxiv: v1 [math.lo] 8 Mar 2018 An interpolant in predicate Gödel logic arxiv:1803.03003v1 [math.lo] 8 Mar 2018 Matthias Baaz 1 baaz@logic.at, Mai Gehrke 2 mgehrke@unice.fr, Sam van Gool 3 samvangool@me.com 1 Institute of Discrete Mathematics

More information

Decision procedure for Default Logic

Decision procedure for Default Logic Decision procedure for Default Logic W. Marek 1 and A. Nerode 2 Abstract Using a proof-theoretic approach to non-monotone reasoning we introduce an algorithm to compute all extensions of any (propositional)

More information

Lecture Notes in Artificial Intelligence

Lecture Notes in Artificial Intelligence Lecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science Edited by J.G. Carbonell and J. Siekmann 1047 Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and

More information

Ludwik Byszewski 1. INTRODUCTION

Ludwik Byszewski 1. INTRODUCTION Opuscula Mathematica Vol. 29 No. 1 2009 Ludwik Byszewski STRONG MAXIMUM PRINCIPLES FOR IMPLICIT PARABOLIC FUNCTIONAL-DIFFERENTIAL PROBLEMS TOGETHER WITH NONLOCAL INEQUALITIES WITH FUNCTIONALS Abstract.

More information

Structural extensions of display calculi: a general recipe

Structural extensions of display calculi: a general recipe Structural extensions of display calculi: a general recipe Agata Ciabattoni and Revantha Ramanayake Vienna University of Technology {agata,revantha}@logic.at Abstract. We present a systematic procedure

More information

Andrzej WROŃSKI ON PRUCNAL S MODEL DETERMINED LOGIC AND DEFINABLE PREDICATES

Andrzej WROŃSKI ON PRUCNAL S MODEL DETERMINED LOGIC AND DEFINABLE PREDICATES REPORTS ON MATHEMATICAL LOGIC 38 (2004), 87 91 Andrzej WROŃSKI ON PRUCNAL S MODEL DETERMINED LOGIC AND DEFINABLE PREDICATES A b s t r a c t. Prucnal s concept of a logic determined by a model is discussed.

More information

Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1

Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1 Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don t want to just find a model, but want to know what

More information

Logic as The Calculus of Computer Science

Logic as The Calculus of Computer Science 1 Ottobre, 2007 1 Università di Napoli Federico II What is a Logic? A Logic is a formalism with a sintax a semantics an inference mechanism for reasoning Historical Diagram The First Age of Logic: Symbolic

More information

Computers and Mathematics with Applications

Computers and Mathematics with Applications Computers and Mathematics with Applications 59 (2010) 431 436 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa A short

More information

FROM AXIOMS TO STRUCTURAL RULES, THEN ADD QUANTIFIERS.

FROM AXIOMS TO STRUCTURAL RULES, THEN ADD QUANTIFIERS. FROM AXIOMS TO STRUCTURAL RULES, THEN ADD QUANTIFIERS. REVANTHA RAMANAYAKE We survey recent developments in the program of generating proof calculi for large classes of axiomatic extensions of a non-classical

More information

Developing Modal Tableaux and Resolution Methods via First-Order Resolution

Developing Modal Tableaux and Resolution Methods via First-Order Resolution Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established

More information

Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC

Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC Australasian Journal of Logic Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC Richard Zach Abstract Priest has provided a simple tableau calculus for Chellas

More information

Splitting a Default Theory. Hudson Turner. University of Texas at Austin.

Splitting a Default Theory. Hudson Turner. University of Texas at Austin. Splitting a Default Theory Hudson Turner Department of Computer Sciences University of Texas at Austin Austin, TX 7872-88, USA hudson@cs.utexas.edu Abstract This paper presents mathematical results that

More information

Logic for Computational Effects: work in progress

Logic for Computational Effects: work in progress 1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,

More information

Ensembles of classifiers based on approximate reducts

Ensembles of classifiers based on approximate reducts Fundamenta Informaticae 34 (2014) 1 10 1 IOS Press Ensembles of classifiers based on approximate reducts Jakub Wróblewski Polish-Japanese Institute of Information Technology and Institute of Mathematics,

More information

Uniform interpolation and sequent calculi in modal logic

Uniform interpolation and sequent calculi in modal logic Uniform interpolation and sequent calculi in modal logic Rosalie Iemhoff March 28, 2015 Abstract A method is presented that connects the existence of uniform interpolants to the existence of certain sequent

More information

Drawing Conclusions from Data The Rough Set Way

Drawing Conclusions from Data The Rough Set Way Drawing Conclusions from Data The Rough et Way Zdzisław Pawlak Institute of Theoretical and Applied Informatics, Polish Academy of ciences, ul Bałtycka 5, 44 000 Gliwice, Poland In the rough set theory

More information

Sequent calculi of quantum logic with strict implication

Sequent calculi of quantum logic with strict implication CTFM 2015 9/7 Sequent calculi of quantum logic with strict implication Tokyo Institute of Technology Graduate School of Information Science and Engineering Tomoaki Kawano About quantum logic Sequent calculi

More information

The Relation Reflection Scheme

The Relation Reflection Scheme The Relation Reflection Scheme Peter Aczel petera@cs.man.ac.uk Schools of Mathematics and Computer Science The University of Manchester September 14, 2007 1 Introduction In this paper we introduce a new

More information

Propositional Logics and their Algebraic Equivalents

Propositional Logics and their Algebraic Equivalents Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic

More information

ON THE EXISTENCE OF PRIME IDEALS IN BOOLEAN ALGEBRAS

ON THE EXISTENCE OF PRIME IDEALS IN BOOLEAN ALGEBRAS LOGIC, ALGBRA, AND COMPUTR SCINC BANACH CNTR PUBLICATIONS, VOLUM 46 INSTITUT OF MATHMATICS POLISH ACADMY OF SCINCS WARSZAWA 1999 ON TH XISTNC OF PRIM IDALS IN BOOLAN ALGBRAS JÖRG FLUM Mathematisches Institut,

More information

Seminar Topic Assignment

Seminar Topic Assignment Seminars @ Knowledge-based Systems Group 184/3 WS 2017/18 Seminar Topic Assignment Institut für Informationssysteme Arbeitsbereich Wissensbasierte Systeme www.kr.tuwien.ac.at Seminar Topics Seminars: Seminar

More information

On interpolation in existence logics

On interpolation in existence logics On interpolation in existence logics Matthias Baaz and Rosalie Iemhoff Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria baaz@logicat, iemhoff@logicat, http://wwwlogicat/people/baaz,

More information

Forcing in Lukasiewicz logic

Forcing in Lukasiewicz logic Forcing in Lukasiewicz logic a joint work with Antonio Di Nola and George Georgescu Luca Spada lspada@unisa.it Department of Mathematics University of Salerno 3 rd MATHLOGAPS Workshop Aussois, 24 th 30

More information

Some Non-Classical Approaches to the Brandenburger-Keisler Paradox

Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Can BAŞKENT The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net KGB Seminar The Graduate Center

More information

A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic

A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic Robert Saxon Milnikel Kenyon College, Gambier OH 43022 USA milnikelr@kenyon.edu Abstract A sequent calculus for skeptical consequence in

More information

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning Yao, Y.Y. and Li, X. Comparison of rough-set and interval-set models for uncertain reasoning Fundamenta Informaticae, Vol. 27, No. 2-3, pp. 289-298, 1996. Comparison of Rough-set and Interval-set Models

More information

On flexible database querying via extensions to fuzzy sets

On flexible database querying via extensions to fuzzy sets On flexible database querying via extensions to fuzzy sets Guy de Tré, Rita de Caluwe Computer Science Laboratory Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium {guy.detre,rita.decaluwe}@ugent.be

More information

ON RANDOM FIXED POINTS IN RANDOM CONVEX STRUCTURES

ON RANDOM FIXED POINTS IN RANDOM CONVEX STRUCTURES STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LIII, Number 2, June 2008 ON RANDOM FIXED POINTS IN RANDOM CONVEX STRUCTURES ASHOK GANGULY, RAGHVENDRA SINGH CHANDEL, AND RAVINDRA PARSAI Abstract. In this

More information

The size of decision table can be understood in terms of both cardinality of A, denoted by card (A), and the number of equivalence classes of IND (A),

The size of decision table can be understood in terms of both cardinality of A, denoted by card (A), and the number of equivalence classes of IND (A), Attribute Set Decomposition of Decision Tables Dominik Slezak Warsaw University Banacha 2, 02-097 Warsaw Phone: +48 (22) 658-34-49 Fax: +48 (22) 658-34-48 Email: slezak@alfa.mimuw.edu.pl ABSTRACT: Approach

More information

Pregroups and their logics

Pregroups and their logics University of Chieti May 6-7, 2005 1 Pregroups and their logics Wojciech Buszkowski Adam Mickiewicz University Poznań, Poland University of Chieti May 6-7, 2005 2 Kazimierz Ajdukiewicz (1890-1963) was

More information

UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS

UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS Bulletin of the Section of Logic Volume 32:1/2 (2003), pp. 19 26 Wojciech Dzik UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS Abstract It is shown that all extensions of S5 modal logic, both

More information

Positive provability logic

Positive provability logic Positive provability logic Lev Beklemishev Steklov Mathematical Institute Russian Academy of Sciences, Moscow November 12, 2013 Strictly positive modal formulas The language of modal logic extends that

More information

Logics preserving degrees of truth and the hierarchies of abstract algebraic logic

Logics preserving degrees of truth and the hierarchies of abstract algebraic logic Logics preserving degrees of truth and the hierarchies of abstract algebraic logic Josep Maria Font Department of Probability, Logic and Statistics Faculty of Mathematics University of Barcelona XV Simposio

More information

Institute of Informatics, University of Warsaw, Warsaw, Poland; Tel.:

Institute of Informatics, University of Warsaw, Warsaw, Poland; Tel.: axioms Article Contribution of Warsaw Logicians to Computational Logic Damian Niwiński Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland; niwinski@mimuw.edu.pl; Tel.: +48-22-554-4460

More information

Principles of Knowledge Representation and Reasoning

Principles of Knowledge Representation and Reasoning Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)

More information

On Proofs and Rule of Multiplication in Fuzzy Attribute Logic

On Proofs and Rule of Multiplication in Fuzzy Attribute Logic On Proofs and Rule of Multiplication in Fuzzy Attribute Logic Radim Belohlavek 1,2 and Vilem Vychodil 2 1 Dept. Systems Science and Industrial Engineering, Binghamton University SUNY Binghamton, NY 13902,

More information

Weak Arithmetics and Kripke Models 1

Weak Arithmetics and Kripke Models 1 Weak Arithmetics and Kripke Models 1 Morteza Moniri Institute for Studies in Theoretical Physics and Mathematics P.O. Box 19395-5746, Tehran, Iran email: ezmoniri@ipm.ir Abstract In the first section of

More information

Concept Lattices in Rough Set Theory

Concept Lattices in Rough Set Theory Concept Lattices in Rough Set Theory Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca URL: http://www.cs.uregina/ yyao Abstract

More information

The Gelfand integral for multi-valued functions.

The Gelfand integral for multi-valued functions. The Gelfand integral for multi-valued functions. B. Cascales Universidad de Murcia, Spain Visiting Kent State University, Ohio. USA http://webs.um.es/beca Special Session on Multivariate and Banach Space

More information

A Fixed Point Representation of References

A Fixed Point Representation of References A Fixed Point Representation of References Susumu Yamasaki Department of Computer Science, Okayama University, Okayama, Japan yamasaki@momo.cs.okayama-u.ac.jp Abstract. This position paper is concerned

More information

AN ALGORITHM FOR FINDING FINITE AXIOMATIZATIONS OF FINITE INTERMEDIATE LOGICS BY MEANS OF JANKOV FORMULAS. Abstract

AN ALGORITHM FOR FINDING FINITE AXIOMATIZATIONS OF FINITE INTERMEDIATE LOGICS BY MEANS OF JANKOV FORMULAS. Abstract Bulletin of the Section of Logic Volume 31/1 (2002), pp. 1 6 Eugeniusz Tomaszewski AN ALGORITHM FOR FINDING FINITE AXIOMATIZATIONS OF FINITE INTERMEDIATE LOGICS BY MEANS OF JANKOV FORMULAS Abstract In

More information

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS REPORTS ON MATHEMATICAL LOGIC 39 (2005), 127 131 Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS 1. Three-valued logics We consider propositional logic. Three-valued logics are old: the first one

More information

Display calculi in non-classical logics

Display calculi in non-classical logics Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi

More information

A Tableau Calculus for Equilibrium Entailment

A Tableau Calculus for Equilibrium Entailment A Tableau Calculus for Equilibrium Entailment David Pearce DFKI Saarbrücken, Germany Inmaculada P. de Guzmán, Agustín Valverde Dept. of Applied Mathematics University of Málaga, Spain Abstract. We apply

More information

LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC

LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC Logic and Logical Philosophy Volume 9 (2001), 91 107 S. P. Odintsov LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC Introduction This article continues the investigation of paraconsistent

More information

Hypersequent calculi for non classical logics

Hypersequent calculi for non classical logics Tableaux 03 p.1/63 Hypersequent calculi for non classical logics Agata Ciabattoni Technische Universität Wien, Austria agata@logic.at Tableaux 03 p.2/63 Non classical logics Unfortunately there is not

More information

185.A09 Advanced Mathematical Logic

185.A09 Advanced Mathematical Logic 185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted

More information

From Bi-facial Truth to Bi-facial Proofs

From Bi-facial Truth to Bi-facial Proofs S. Wintein R. A. Muskens From Bi-facial Truth to Bi-facial Proofs Abstract. In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological

More information

NON-FREGEAN LOGICS OF ANALYTIC EQUIVALENCE (II)

NON-FREGEAN LOGICS OF ANALYTIC EQUIVALENCE (II) Bulletin of the Section of Logic Volume 44:1/2 (2015), pp. 69 79 Andrzej Bi lat In memory of Andrzej Grzegorczyk NON-FREGEAN LOGICS OF ANALYTIC EQUIVALENCE (II) Abstract This paper presents the main assumptions

More information

Interpreting Low and High Order Rules: A Granular Computing Approach

Interpreting Low and High Order Rules: A Granular Computing Approach Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:

More information

On the duality of proofs and countermodels in labelled sequent calculi

On the duality of proofs and countermodels in labelled sequent calculi On the duality of proofs and countermodels in labelled sequent calculi Sara Negri Department of Philosophy PL 24, Unioninkatu 40 B 00014 University of Helsinki, Finland sara.negri@helsinki.fi The duality

More information

A GENTZEN SYSTEM EQUIVALENT TO THE BCK-LOGIC

A GENTZEN SYSTEM EQUIVALENT TO THE BCK-LOGIC Romà J. Adillon Ventura Verdú A GENTZEN SYSTEM EQUIVALENT TO THE BCK-LOGIC Abstract The sequent calculus L BCK is obtained by deleting the contraction rule and the introduction rules of the connectives

More information

ARPN Journal of Science and Technology All rights reserved.

ARPN Journal of Science and Technology All rights reserved. Rule Induction Based On Boundary Region Partition Reduction with Stards Comparisons Du Weifeng Min Xiao School of Mathematics Physics Information Engineering Jiaxing University Jiaxing 34 China ABSTRACT

More information

Subtractive Logic. To appear in Theoretical Computer Science. Tristan Crolard May 3, 1999

Subtractive Logic. To appear in Theoretical Computer Science. Tristan Crolard May 3, 1999 Subtractive Logic To appear in Theoretical Computer Science Tristan Crolard crolard@ufr-info-p7.jussieu.fr May 3, 1999 Abstract This paper is the first part of a work whose purpose is to investigate duality

More information

Knowledge Discovery Based Query Answering in Hierarchical Information Systems

Knowledge Discovery Based Query Answering in Hierarchical Information Systems Knowledge Discovery Based Query Answering in Hierarchical Information Systems Zbigniew W. Raś 1,2, Agnieszka Dardzińska 3, and Osman Gürdal 4 1 Univ. of North Carolina, Dept. of Comp. Sci., Charlotte,

More information

Generalised elimination rules and harmony

Generalised elimination rules and harmony Generalised elimination rules and harmony Roy Dyckhoff Based on joint work with Nissim Francez Supported by EPSR grant EP/D064015/1 St ndrews, May 26, 2009 1 Introduction Standard natural deduction rules

More information

A Generalized Decision Logic in Interval-set-valued Information Tables

A Generalized Decision Logic in Interval-set-valued Information Tables A Generalized Decision Logic in Interval-set-valued Information Tables Y.Y. Yao 1 and Qing Liu 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca

More information

SIMPLE DECISION PROCEDURE FOR S5 IN STANDARD CUT-FREE SEQUENT CALCULUS

SIMPLE DECISION PROCEDURE FOR S5 IN STANDARD CUT-FREE SEQUENT CALCULUS Bulletin of the Section of Logic Volume 45/2 (2016), pp. 125 140 http://dx.doi.org/10.18778/0138-0680.45.2.05 Andrzej Indrzejczak SIMPLE DECISION PROCEDURE FOR S5 IN STANDARD CUT-FREE SEQUENT CALCULUS

More information

Nonclassical logics (Nichtklassische Logiken)

Nonclassical logics (Nichtklassische Logiken) Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter

More information

Modal logics: an introduction

Modal logics: an introduction Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and

More information

COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS

COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS Bulletin of the Section of Logic Volume 18/4 (1989), pp. 153 160 reedition 2006 [original edition, pp. 153 160] Ildikó Sain COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS In this paper we solve some

More information

Chapter 11: Automated Proof Systems (1)

Chapter 11: Automated Proof Systems (1) Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems

More information

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC Bulletin of the Section of Logic Volume 10/4 (1981), pp. 185 190 reedition 2009 [original edition, pp. 185 191] Newton C. A. da Costa Elias H. Alves RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED

More information

NEW RESULTS IN LOGIC OF FORMULAS WHICH LOSE SENSE

NEW RESULTS IN LOGIC OF FORMULAS WHICH LOSE SENSE Bulletin of the Section of Logic Volume 14/3 (1985), pp. 114 119 reedition 2007 [original edition, pp. 114 121] Adam Morawiec Krystyna Piróg-Rzepecka NEW RESULTS IN LOGIC OF FORMULAS WHICH LOSE SENSE Abstract

More information

A Deep Inference System for the Modal Logic S5

A Deep Inference System for the Modal Logic S5 A Deep Inference System for the Modal Logic S5 Phiniki Stouppa March 1, 2006 Abstract We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep

More information

Tolerance Approximation Spaces. Andrzej Skowron. Institute of Mathematics. Warsaw University. Banacha 2, Warsaw, Poland

Tolerance Approximation Spaces. Andrzej Skowron. Institute of Mathematics. Warsaw University. Banacha 2, Warsaw, Poland Tolerance Approximation Spaces Andrzej Skowron Institute of Mathematics Warsaw University Banacha 2, 02-097 Warsaw, Poland e-mail: skowron@mimuw.edu.pl Jaroslaw Stepaniuk Institute of Computer Science

More information

Mathematica Bohemica

Mathematica Bohemica Mathematica Bohemica Radomír Halaš Remarks on commutative Hilbert algebras Mathematica Bohemica, Vol. 127 (2002), No. 4, 525--529 Persistent URL: http://dml.cz/dmlcz/133956 Terms of use: Institute of Mathematics

More information

On Modal Logics of Partial Recursive Functions

On Modal Logics of Partial Recursive Functions arxiv:cs/0407031v1 [cs.lo] 12 Jul 2004 On Modal Logics of Partial Recursive Functions Pavel Naumov Computer Science Pennsylvania State University Middletown, PA 17057 naumov@psu.edu June 14, 2018 Abstract

More information

EIS property for dependence spaces

EIS property for dependence spaces for dependence spaces AAA88, Warsaw 19 22 June 2014 for dependence spaces for dependence spaces According to F. Gécseg, H. Jürgensen [3] the result which is usually referred to as the Exchange Lemma states

More information

260 Index. Cut (cont.) rank, 193, 202 segment, 201 Cut-off subtraction, 211

260 Index. Cut (cont.) rank, 193, 202 segment, 201 Cut-off subtraction, 211 References J. Barwise (ed.). Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977 G. Boolos. The Logic of Provability. Cambridge University Press, Cambridge, 1993 E. Börger. Computability, Complexity,

More information