close this section of the libraryftp://cisr.anu.edu.au (48)
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-2-95.ps.gz, 19950130
Technical Report TR-ARP-2-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University January 11, 1995 REALISTIC BELIEF REVISION Greg Restall and John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-12-94.ps.gz, 19950130
Technical Report TR-ARP-12-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December 31, 1994 MINLOG John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-1-94.ps.gz, 19950130
Technical Report TR-ARP-1-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 26, 1994 THE CRISIS IN FINITE MATHEMATICS: AUTOMATED REASONING AS CAUSE AND CURE John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-2-94.ps.gz, 19950130
Technical Report TR-ARP-2-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 26, 1994 FINDER: FINITE DOMAIN ENUMERATOR SYSTEM DESCRIPTION John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-6-94.ps.gz, 19950130
Technical Report TR-ARP-6-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 30, 1994 ARITHMETIC AND TRUTH IN LUKASIEWICZ'S INFINITELY VALUED LOGIC Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-7-94.ps.gz, 19950130
Technical Report TR-ARP-7-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 13, 1994 ADVENTURES IN BLOCKS WORLD John Slaney and Sylvie Thi ebaux
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-1-95.ps.gz, 19950130
Technical Report TR-ARP-1-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University January, 1, 1995 INTUITIONISTIC LOGIC REDISPLAYED Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-11-94.ps.gz, 19950130
Technical Report TR-ARP-11-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November, 11, 1994 Displaying and Deciding Substructural Logics 1 Logics with Contraposition Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-8-94.ps.gz, 19950130
Technical Report TR-ARP-8-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 16, 1994 LOGICAL LAWS Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-10-94.ps.gz, 19950130
Technical Report TR-ARP-10-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September, 27, 1994 TRUTHMAKERS, ENTAILMENT AND NECESSITY Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-3-94.ps.gz, 19950130
Technical Report TR-ARP-3-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 26, 1994 SCOTT: SEMANTICALLY CONSTRAINED OTTER SYSTEM DESCRIPTION John Slaney, Ewing Lusk and William McCune
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1994/TR-ARP-9-94.ps.gz, 19950130
Technical Report TR-ARP-9-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September, 16, 1994 FOUR-VALUED SEMANTICS FOR RELEVANT LOGICS (AND SOME OF THEIR RIVALS) Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-5-95.ps.gz, 19950425
Technical Report TR-ARP-5-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University January, 1, 1995 Combining Possibilities and Negations Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-6-95.ps.gz, 19950426
Technical Report TR-ARP-6-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April, 26, 1995 A UNIFORM DISPLAY SYSTEM FOR INTUITIONISTIC AND DUAL INTUITIONISTIC LOGIC Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-3-95.ps, 19950426
Technical Report TR-SRS-3-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University January, 19, 1995 ON THE COMPLETENESS OF CLASSICAL TENSE DISPLAY LOGIC Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-2-95.ps, 19950426
Technical Report TR-SRS-2-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April, 26, 1995 A UNIFORM DISPLAY SYSTEM FOR INTUITIONISTIC AND DUAL INTUITIONISTIC LOGIC Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-11-95.ps.gz, 19950620
Technical Report TR-ARP-11-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University June 19, 1995 MaGIC, MATRIX GENERATOR FOR IMPLICATION CONNECTIVES: RELEASE 2.1 NOTES AND GUIDE John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-9-95.ps.gz, 19950810
Technical Report TR-ARP-9-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 26, 1995 RELEVANT ENTAILMENT AND MODAL REALISM Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-14-95.ps.gz, 19950810
Technical Report TR-ARP-14-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University August 10, 1995 PARACONSISTENT LOGICS! Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/gore.ps, 19950812
Gaggles, Gentzen and Galois: A Proof Theory for Algebraizable Logics Rajeev Gor e Automated Reasoning Project rpg@cisr.anu.edu.au April 16, 1995 Abstract We show how the Gaggle Theory of Dunn gives a Gentzen-style proof theory for many algebraizable logics via the Display Logic of Belnap. At the heart
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/bunder.ps, 19950812
Finding Proofs in Fixed Finite Time in Classical Propositional Logics
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/schmidt.ps, 19950812
Towards reasoning about concurrent objects Heinz W. Schmidt and Jian Chen Department Software Development Monash University, Melbourne P.O. Box 197, Caulfield East, 3145, Australia e-mail: Heinz.Schmidt@fcit.monash.edu.au
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-16-95.ps, 19951016
Technical Report TR-ARP-16-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 19, 1995 RELATIONS BETWEEN PROPOSITIONAL NORMAL MODAL LOGICS: AN OVERVIEW Rajeev Gor e Wolfgang Heinle
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/wright.ps, 19951031
V i j k
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/wobcke.ps, 19951105
A Logic of Belief and Intention Wayne Wobcke Knowledge Systems Group, Basser Dept of Computer Science University of Sydney, Sydney NSW 2006, Australia
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-4-95.ps, 19951106
Technical Report TR-SRS-4-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 20, 1995 SYMBOLIC ECOLOGY 1 Chris Mortensen Department of Philosophy The University of Adelaide North Tce.
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/mortensen.ps, 19951106
SYMBOLIC ECOLOGY 1 Chris Mortensen Department of Philosophy The University of Adelaide North Tce. Adelaide, SA. Australia 5005 cmortens@arts.adelaide.edu.au
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/restall.ps, 19951106
Lukasiewicz, Supervaluations, and the Future Greg Restall Greg.Restall@anu.edu.au http://arp.anu.edu.au/arp/gar/gar.html Automated Reasoning Project Australian National University Canberra, act 0200, australia Will there be a sea battle tomorrow If we wish to take indeterminism seriously, we might agree
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/gore.ps, 19951106
Relations between propositional normal modal logics: an overview Rajeev Gor e Wolfgang Heinle y Alain Heuerding y Automated Reasoning Project yInstitut fur Informatik Australian National University und angewandte Mathemetik Canberra, Australia University of Bern rpg@cisr.anu.edu.au Bern, Switzerland
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/slaney.ps, 19951106
Combining Model Generation with Theorem Proving: Problems and Prospects John Slaney and Timothy J. Surendonk Automated Reasoning Project, Australian National University Canberra 0200, Australia fJohn.Slaney, Timothy.Surendonkg@anu.edu.au 1 Proof search, model search and their interaction 1.1 Background
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-18-95.ps.gz, 19951113
Technical Report TR-ARP-18-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November 14, 1995 Generating Random States of Blocks World John Slaney
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/wobcke-revised.ps, 19951127
Belief Revision without Rational Monotony Wayne Wobcke Knowledge Systems Group, Basser Dept of Computer Science University of Sydney, Sydney NSW 2006, Australia
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-22-95.ps, 19951207
Technical Report TR-ARP-22-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December 7, 1995 DISPLAY LOGIC AND GAGGLE THEORY Greg Restall
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-12-95.ps, 19951208
Technical Report TR-ARP-12-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University June, 1995 Solving the Display Problem via Residuation Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-15-95.ps.gz, 19951215
Technical Report TR-ARP-15-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November 13, 1995 Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/TR-SRS-5-95.ps, 19960103
Technical Report TR-SRS-5-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November 12, 1995 SRS-III: Proceedings of the Third Symbolic Reasoning Systems Project and Third Automated Reasoning
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-4-95.ps.gz, 19960208
Technical Report TR-ARP-4-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November 27, 1995 Canonicity for Intensional Logics Without Iterative Axioms Timothy J. Surendonk
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-10-95.ps.gz, 19960227
Technical Report TR-ARP-10-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University February 27, 1996 A Non-Standard Injection Between Canonical Frames Timothy J. Surendonk
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-19-95.ps.gz, 19960301
Technical Report TR-ARP-19-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December, 7, 1995 Cut-free Display Calculi for Relational Algebras Rajeev Gor e
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/brady.ps.gz, 19960410
SIMPLE CONSISTENCY OF THE HIGHER-ORDER PREDICATE LOGIC. Ross Brady, School of Philosophy, La Trobe University. We formalize the higher-order predicate logic by adding the following to that of DJdQ. Primitives. 1. Fn(i , ,ifi), Gn(j , ,jfi), Hn(k , ,kfi), In(l , ,lfi), (variables over predicates with n
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/howe.ps.gz, 19960412
Decision LogicGuy HoweDepartment of PhilosophyAustralian National Universityguy@arp.anu.edu.auph61-6-267 4452SummaryIn this paper, I present a summary of my work to date on an improved formalism for decision-making. This formalism, which I call Decision Logic, adds binary preference relations to a
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/surendonk.ps.gz, 19960412
What Can We Say About Isomorphisms Between Canonical Frames Timothy J. Surendonk April 12, 1996
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/meyer-restall.ps.gz, 19960415
Strenge Arithmetic Robert K. Meyer and Greg Restall @anu.edu.au Automated Reasoning Project Australian National University act 0200 April 15, 1996 1 Arithmetics Consider the traditional Peano axioms for arithmetic. Identity = 8x8y(x = y ! y = x) 8x8y8z y = z ! (x = y ! x = z)
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/slaney-meyer.ps.gz, 19960415
Logic for Two: Part A (extended abstract) John Slaney Robert Meyer This abstract covers the first part of . Our aim is to introduce a wide class of nonclassical logics to a general audience, showing that far from being esoteric and contrived they sustain an extremely natural, readily comprehensible
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/nowak.ps.gz, 19960415
Notes on intensional knowledge|conceptuality, partiality, inconsistency and preference Chris Nowak Computer Science Department The University of Adelaide Email: nowak@cs.adelaide.edu.au 1 Introduction In this introduction we provide some fundamental notions of Formal Concept Analysis (FCA) and give an
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/liu-orgun.ps.gz, 19960416
TLC: A Temporal Logic with Clocks Chuchang Liu Mehmet A. Orgun Department of Computing Macquarie University NSW 2109, Australia E-mail: fcliu,mehmetg@krakatoa.mpce.mq.edu.au
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/tanaka.ps.gz, 19960416
Are Relevant Systems Good For Belief Revision 1 Koji Tanaka School of Computing and Information Technology Griffith University Nathan QLD 4111 Australia e-mail: ktanaka@cit.gu.edu.au Department of Philosophy The University of Queensland St.Lucia QLD 4072 Australia e-mail: bluesky@lingua.cltr.uq.oz.au In
open this document and view contentsftp://cisr.anu.edu.au/pub/techreports/1995/TR-ARP-04-95.ps.gz, 19960513
Technical Report TR-ARP-4-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 13, 1996 Canonicity for Intensional Logics Without Iterative Axioms Timothy J. Surendonk