close this section of the libraryftp://arp.anu.edu.au (102)
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1994/TR-ARP-02-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://arp.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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-4-94.ps.gz, 19950130
Technical Report TR-ARP-4-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April 11, 1994 FINITE MODELS FOR SOME SUBSTRUCTURAL LOGICS John Slaney
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1994/TR-ARP-07-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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-02-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://arp.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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-06-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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-01-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://arp.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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-09-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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-03-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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-05-94.ps.gz, 19950130
Technical Report TR-ARP-5-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 13, 1994 MODALITIES IN SUBSTRUCTURAL LOGICS Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1994/TR-ARP-04-94.ps.gz, 19950130
Technical Report TR-ARP-4-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April 11, 1994 FINITE MODELS FOR SOME SUBSTRUCTURAL LOGICS John Slaney
open this document and view contentsftp://arp.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://arp.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://arp.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://arp.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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-01-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://arp.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://arp.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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-08-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://arp.anu.edu.au/pub/techreports/1994/TR-ARP-5-94.ps.gz, 19950130
Technical Report TR-ARP-5-94 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University March 13, 1994 MODALITIES IN SUBSTRUCTURAL LOGICS Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-03-95.ps.gz, 19950411
Technical Report TR-ARP-3-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University February 20, 1995 NEGATION IN RELEVANT LOGICS (How I stopped worrying and learned to love the Routley Star) Greg
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-3-95.ps.gz, 19950411
Technical Report TR-ARP-3-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University February 20, 1995 NEGATION IN RELEVANT LOGICS (How I stopped worrying and learned to love the Routley Star) Greg
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-05-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://arp.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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-3-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-07-95.ps.gz, 19950426
Technical Report TR-ARP-7-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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-2-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-7-95.ps.gz, 19950426
Technical Report TR-ARP-7-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://arp.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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-06-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://arp.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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-13-95.ps.gz, 19950808
Technical Report TR-ARP-13-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University August 8, 1995, 1995 Semantically Constrained Condensed Detachment is Incomplete John Slaney and Timothy J.
open this document and view contentsftp://arp.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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-09-95.ps.gz, 19950811
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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/brady.ps.gz, 19950812
On Gentzen Systems for Logics Without Contradiction Ross T. Brady LaTrobe University During the last 12 months, I have been involved in the following topics : (i) Finding simple Gentzenizations for contraction-less sentential logics, subject to the set of formulae being restricted to what are called
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/restall-slaney.ps.gz, 19950812
Realistic Belief Revision Greg Restall and John Slaney Automated Reasoning Project @anu.edu.au In this paper we consider the implications for belief revision of weakening the logic under which belief sets are taken to be closed. A widely held view is that the usual belief
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/_front.ps.gz, 19950812
Technical Report TR-SRS-1-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April 21-22, 1995 SRS-II: Proceedings of the Second Symbolic Reasoning Systems Workshop Editor: Rajeev Gor e
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/gore.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/sutcliffe.ps.gz, 19950812
A Framework for Building Parallel ATPs Geoff Sutcliffe and Kalvinder Singh James Cook University 1 Introduction Automated Theorem Proving (ATP) systems attempt to prove proposed theorems from given sets of axioms. The one major problem with ATP systems is that proving difficult theorems requires
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/schmidt.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/restall.ps, 19950812
Proof Theories for Almost Anything (Display Calculi for Substructural Logics) Greg Restall Automated Reasoning Project, Australian National University email: Greg.Restall@anu.edu.au www: http://arp.anu.edu.au/arp/gar/gar.html Nuel Belnap's Display Logic is a neat, uniform method for providing a
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/_introduction.ps.gz, 19950812
Introduction Greg Restall Automated Reasoning Project, Australian National University email: Greg.Restall@anu.edu.au www: http://arp.anu.edu.au/arp/gar/gar.html This is a wide ranging and varied collection of papers. You might think that there is no common thread between them, except for the fact that
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/wobcke.ps.gz, 19950812
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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/mortensen.ps.gz, 19950812
The Leibniz Continuity Condition, Inconsistency and Quantum Dynamics. Chris Mortensen Philosophy Department The University of Adelaide 1.Introduction. By any standards, Leibniz was a great thinker. His contributions to the calculus and the theory of space and time were of fundamental importance, while
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-16-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-17-95.ps.gz, 19951031
Technical Report TR-ARP-17-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University October 31, 1995 BLOCKS WORLD TAMED Ten thousand blocks in under a second John Slaney and Sylvie Thi ebaux
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/wright.ps.gz, 19951101
V i j k
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/gore.ps.gz, 19951106
Relations between propositional normal modal logics: an overview Rajeev Gor e Wolfgang Heinle y Alain Heuerding y Automated Reasoning Project yInstitut f ur 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/meyer.ps.gz, 19951106
TYPES AND THE BOOLEAN SYSTEM CB+ Robert K. Meyer Australian National University In , Barendregt, Coppo and Dezani (henceforth BCD) set out the following postulates on an intersection theory of types ITD. Primitive are type variables, w (universal type), (type inclusion), (type intersection), and fi.
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-4-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/mortensen.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/roeper.ps.gz, 19951106
3. November 1995 APFs for Intuitionistic Propositional Logic 1 Absolute Probability Functions for Intuitionistic Propositional Logic Peter Roeper and Hugues Leblanc By an absolute probability function for intuitionistic propositional logic we shall mean any function on the statements of a propositional
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/slaney.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/wobcke.ps.gz, 19951106
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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/restall.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/surendonk.ps.gz, 19951106
Does EK4 have the Finite Model Property and related open questions Timothy J. Surendonk November 5, 1995
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-18-95.ps.gz, 19951114
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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/meyer-revised.ps, 19951116
1 TYPES AND THE BOOLEAN SYSTEM CB+ Robert K. Meyer Australian National University In , Barendregt, Coppo and Dezani (henceforth BCD) set out the following postulates on an intersection theory of types ITD. Primitive are type variables, w (universal type), (type inclusion), (type intersection), and
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-1-95/wobcke-revised.ps.gz, 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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-21-95.ps.gz, 19951207
Technical Report TR-ARP-21-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December 7, 1996 LUKASIEWICZ, SUPERVALUATIONS, AND THE FUTURE Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-22-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/1995/TR-ARP-20-95.ps.gz, 19951207
Technical Report TR-ARP-20-95 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December 7, 1995 CONSEQUENCES OF NEGATIONS Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-12-95.ps.gz, 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://arp.anu.edu.au/pub/techreports/SRS/1995/TR-SRS-5-95/TR-SRS-5-95.ps.gz, 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://arp.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://arp.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://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/brady.ps.gz, 19960411
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://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/bunder.ps.gz, 19960411
1 S Some Decision Procedures for Implicational Logics M.W. Bunder
open this document and view contentsftp://arp.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://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/priest.ps.gz, 19960412
Multiple Denotation, Ambiguity, and the Case of the Missing Amoeba Graham Priest Department of Philosophy University of Queensland ggp@lingua.cltr.uq.oz.au The paper falls into two parts. Taking off from some insights in the semantics of paraconsistent logic, the first part sets up the formal semantic
open this document and view contentsftp://arp.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://arp.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://arp.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://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/gore.ps.gz, 19960415
Cut-free Display Calculi for Relation Algebras Rajeev Gor e rpg@arp.anu.edu.au Automated Reasoning Project We give a propositional cut-free Gentzen-style calculus for relation algebras using Belnap's Display Logic. The calculus caters for a large class of axiomatic extensions of relation algebras where
open this document and view contentsftp://arp.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://arp.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://arp.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://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/roberts.ps.gz, 19960416
Maybe, Maybe Not: a Probabilistic Semantics for First Degree Entailment and LP - the propositional cases. Lesley Roberts University of Queensland In this paper I set out a probabilistic semantics for the propositional logics of First Degree Entailment (FDE) and LP. I detail a probability calculus and
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/SRS/1996/TR-SRS-1-96/TR-SRS-1-96.ps.gz, 19960423
Technical Report TR-SRS-1-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University April 16, 1996 SRS-IV: Proceedings of the Fourth Symbolic Reasoning Systems Workshop Editor: Rajeev Gor e
open this document and view contentsftp://arp.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
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-01-96.ps.gz, 19960516
Technical Report TR-ARP-01-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 16, 1996 A Note on Isomorphisms Between Canonical Frames Timothy J. Surendonk
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-02-96.ps.gz, 19960527
Technical Report TR-ARP-2-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 22, 1996 LINEAR ARITHMETIC DESECSED John K. Slaney Robert K. Meyer Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-03-96.ps.gz, 19960604
Technical Report TR-SRS-3-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University June 4, 1996 KD45 is not a doxastic logic John Slaney
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/kd45.ps.gz, 19960604
Technical Report TR-SRS-3-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University June 4, 1996 KD45 is not a doxastic logic John Slaney
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-04-96.ps.gz, 19960920
Technical Report TR-ARP-04-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 20, 1996 Neighborhoods, Ultra lters, and Canonicity Timothy J. Surendonk
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-05-96.ps.gz, 19961029
Technical Report TR-ARP-05-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University September 27, 1996 Expressing Sets With Ultra lters and the Canonicity of the Sahlqvist Logics Timothy J. Surendonk
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-06-96.ps.gz, 19961103
Technical Report TR-ARP-6-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University November 1, 1996 HOW BEST TO PUT THINGS ON TOP OF OTHER THINGS John Slaney and Sylvie Thi ebaux
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-07-96.ps.gz, 19961213
Technical Report TR-ARP-07-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University December 13, 1996 An Error in Grove's Proof Graham Priest Timothy J. Surendonk Department of Philosophy Automated
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1996/TR-ARP-08-96.ps.gz, 19961220
Technical Report TR-ARP-8-96 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University July, 11, 1996 NOTES ON SITUATION THEORY AND CHANNEL THEORY Greg Restall
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-01-97.ps.gz, 19970104
Technical Report TR-ARP-1-97 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University January 3, 1997 Logic for Two: The Semantics of Distributive Substructural Logics John Slaney and Robert Meyer
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-02-97.ps.gz, 19970428
Technical Report TR-ARP-2-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University April, 23, 1997 Free Variable Tableaux for Propositional Modal Logics Bernhard Beckert and Rajeev Gor e
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-04-97.ps.gz, 19970507
Technical Report TR-ARP-04-97 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 7, 1997 Revising Some Basic Proofs in Belief Revision Timothy J. Surendonk
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-05-97.ps.gz, 19970527
Technical Report TR-ARP-05-97 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University May 27, 1997 Canonicity for Intensional Logics With Even Axioms Timothy J. Surendonk
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-06-97.ps.gz, 19970813
Technical Report TR-ARP-06-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University January 21, 1995 Undecidability of Relevant Logics Pragati Jain
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-08-97.ps.gz, 19970911
Technical Report TR-ARP-08-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University August, 22, 1997 Substructural Logics on Display Rajeev Gore
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-07-97.ps.gz, 19970911
Technical Report TR-ARP-07-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University August, 22, 1997 GAGGLES, GENTZEN AND GALOIS: CUT-FREE DISPLAY CALCULI AND RELATIONAL SEMANTICS FOR ALGEBRAIZABLE LOGICS Rajeev Gor e
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-09-97.ps.gz, 19970919
Technical Report TR-ARP-09-97 Automated Reasoning Project Research School of Information Sciences and Engineering and Centre for Information Science Research Australian National University August 8, 1997 PHASE TRANSITIONS AND OPTIMALITY: SENSE AND NONSENSE John Slaney and Sylvie Thi ebaux
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1995/TR-ARP-15-95.ps, 19971003
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 May 5, 1995 (last revised Sep12, 1997) Rajeev Gor e
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-03-97.ps.gz, 19971114
Technical Report TR-ARP-TR-ARP-02-97-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University February, 10, 1997 LABELLED SEQUENTS FOR PROPOSITIONAL TENSE LOGICS Nicolette Bonnette and Rajeev Gor e
open this document and view contentsftp://arp.anu.edu.au/pub/techreports/1997/TR-ARP-10-97.ps.gz, 19980121
Technical Report TR-ARP-10-97 Automated Reasoning Project Research School of Information Sciences and Engineering Australian National University Canberra, ACT, 0200 Australia Nov. 7 , 1997 Weak Aggregative Modal Logics With Multi-ary Modal Operators Paul Wong wongas@arp.anu.edu.au