Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic (...) to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing. (shrink)

This essay discusses rules and semantic clauses relating to Substitution—Leibniz’s law in the conjunctive-implicational form s=t ∧ A(s) → A(t)—as these are put forward in Priest’s books "In Contradiction" and "An Introduction to Non-Classical Logic: From If to Is." The stated rules and clauses are shown to be too weak in some cases and too strong in others. New ones are presented and shown to be correct. Justification for the various rules are probed and it is argued that Substitution ought (...) to fail. (shrink)

In this paper we treat metasequents—objects which stand to sequents as sequents stand to formulas—as first class logical citizens. To this end we provide a metasequent calculus, a sequent calculus which allows us to directly manipulate metasequents. We show that the various metasequent calculi we consider are sound and complete w.r.t. appropriate classes of tetravaluations where validity is understood locally. Finally we use our metasequent calculus to give direct syntactic proofs of various collapse results, closing a problem left open in (...) French (Ergo, 3(5), 113–131 2016). (shrink)

In this paper we treat metasequents—objects which stand to sequents as sequents stand to formulas—as first class logical citizens. To this end we provide a metasequent calculus, a sequent calculus which allows us to directly manipulate metasequents. We show that the various metasequent calculi we consider are sound and complete w.r.t. appropriate classes of tetravaluations where validity is understood locally. Finally we use our metasequent calculus to give direct syntactic proofs of various collapse results, closing a problem left open in (...) French (Ergo, 3(5), 113–131 2016). (shrink)

Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate (...) for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens. (shrink)

In the recent paper “Naive modus ponens”, Zardini presents some brief considerations against an approach to semantic paradoxes that rejects the transitivity of entailment. The problem with the approach is, according to Zardini, that the failure of a meta-inference closely resembling modus ponens clashes both with the logical idea of modus ponens as a valid inference and the semantic idea of the conditional as requiring that a true conditional cannot have true antecedent and false consequent. I respond on behalf of (...) the non-transitive approach. I argue that the meta-inference in question is independent from the logical idea of modus ponens, and that the semantic idea of the conditional as formulated by Zardini is inadequate for his purposes because it is spelled out in a vocabulary not suitable for evaluating the adequacy of the conditional in semantics for non-transitive entailment. I proceed to generalize the semantic idea of the conditional and show that the most popular semantics for non-transitive entailment satisfies the new formulation. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

In this paper, I discuss Whiting’s (2021) account of rational belief and discuss some unresolved issues arising from its reliance on epistemic possibility and, by extension, perspective-relative aprioricity.

I argue for the unexceptionality of evidence about what rationality requires. Specifically, I argue that, as for other topics, one’s total evidence can sometimes support false beliefs about this. Despite being prima facie innocuous, a number of philosophers have recently denied this. Some have argued that the facts about what rationality requires are highly dependent on the agent’s situation and change depending on what that situation is like. (Bradley 2019). Others have argued that a particular subset of normative truths, those (...) concerning what epistemic rationality requires, have the special property of being ‘fixed points’—it is impossible to have total evidence that supports false belief about them. (Smithies 2012; Titelbaum 2015). Each of these kinds of exceptionality permits a solution to downstream theoretical problems that arise from the possibility of evidence supporting false belief about requirements of rationality. However, as I argue here, they incur heavy explanatory burdens that we should avoid. (shrink)

The aim of this paper is to lay bare the roots of dialetheism in discussions about dialectics and dialectical logic at the time of the first development of paraconsistent logics. In other words, th...

My aim is to reconstruct the basic steps and the fundamental idea of Kant’s transcendental deduction of categories as well as Hegel’s interpretation and reframing of Kant’s idea. Hegel’s reading is crucial for two reasons: first, for fixing the basic form of the Kant­ian argument and secondly, for understanding its metaphilosophical relevance. For Hegel, philosophical proof has a specific nature, which distinguishes it from scientific proof and brings it closer to a juridical one. In this perspective the transcendental deduction, which (...) is universally considered one of the most difficult chapters in the history of philosophy, reveals itself as the genuine clarification of specifically philosophical proof. I first present the idea of Kant’s transcendental deduction in the Critique of Pure Reason as well as its Hegelian reading in the Science of Logic and reformulation as the very method of philosophy in the Philo­sophy of Right. I show what in the Kantian argumentation constituted the basis for Hegel’s own interpretation and transformation. In so doing, I highlight a ‘red thread’ between the two ideas of the transcendental deduction. I conclude by proposing a formal account of Kant’s and Hegel’s ideas and by summing up the main metaphilosophical insights we can gain from Kant’s idea and its Hegelian interpretation. (shrink)

Some authors have claimed that Hegel's ‘determinate negation’ should be distinguished from ‘logical’ or ‘formal’ negation, that is, from a view of negation as a contradictory forming operator. In contrast, I argue that dialectical determinate negation involves a view of negation as a contradictory forming operator, and can therefore count as formal negation in every respect. However, as it is clear in contemporary glutty semantics of negation, one may distinguish between different accounts of the relationship between negation, contradiction and content. (...) I suggest that, differently from classical negation, and as glutty negation, dialectical negation has partial content. (shrink)

We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B 3 and Graham Priest’s (...) non-symmetrized connexive logic and that Oller’s system lies just beneath the intersection of B 3 and Priest’s paraconsistent L P. We conclude by examining Oller’s system in more depth, giving it a characterization in terms of L P and showing that it plays the same role to Harry Deutsch’s paraconsistent containment logic S that Aleksandr Zinov'ev’s S 1 plays with respect to A I. (shrink)

J. Michael Dunn’s Theorem in 3-Valued Model Theory and Graham Priest’s Collapsing Lemma provide the means of constructing first-order, three-valued structures from classical models while preserving some control over the theories of the ensuing models. The present article introduces a general construction that we call a Dunn–Priest quotient, providing a more general means of constructing models for arbitrary many-valued, first-order logical systems from models of any second system. This technique not only counts Dunn’s and Priest’s techniques as special cases, but (...) also provides a generalized Collapsing Lemma for Priest’s more recent plurivalent semantics in general. We examine when and how much control may be exerted over the resulting theories in particular cases. Finally, we expand the utility of the construction by showing that taking Dunn–Priest quotients of a family of structures commutes with taking an ultraproduct of that family, increasing the versatility of the tool. (shrink)

Many analyses of notion of _metainferences_ in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e._, inferences involving objects belonging (...) to more than one (meta)inferential level and solves several other limitations of the ST hierarchies introduced by Barrio, Pailos, and Szmuc. (shrink)

Despite a renewed interest in Richard Angell’s logic of analytic containment ), the first semantics for \ introduced by Fabrice Correia has remained largely unexamined. This paper describes a reasonable approach to Correia semantics by means of a correspondence with a nine-valued semantics for \. The present inquiry employs this correspondence to provide characterizations of a number of propositional logics intermediate between \ and classical logic. In particular, we examine Correia’s purported characterization of classical logic with respect to his semantics, (...) showing the condition Correia cites in fact characterizes the “logic of paradox” \ and provide a correct characterization. Finally, we consider some remarks on related matters, such as the applicability of the present correspondence to the analysis of the system \ and an intriguing relationship between Correia’s models and articular models for first degree entailment. (shrink)

The hallmark of the deductive systems known as ‘conceptivist’ or ‘containment’ logics is that for all theorems of the form , all atomic formulae appearing in also appear in . Significantly, as a consequence, the principle of Addition fails. While often billed as a formalisation of Kantian analytic judgements, once semantics were discovered for these systems, the approach was largely discounted as merely the imposition of a syntactic filter on unrelated systems. In this paper, we examine a number of prima (...) facie unrelated deductive contexts in which Addition fails and attempt to harmonise them by developing a computational interpretation of conceptivist logics. (shrink)

Quantum set theory and topos quantum theory are two long running projects in the mathematical foundations of quantum mechanics that share a great deal of conceptual and technical affinity. Most pertinently, both approaches attempt to resolve some of the conceptual difficulties surrounding QM by reformulating parts of the theory inside of nonclassical mathematical universes, albeit with very different internal logics. We call such mathematical universes, together with those mathematical and logical structures within them that are pertinent to the physical interpretation, (...) ‘Q-worlds’. Here, we provide a unifying framework that allows us to better understand the relationship between different Q-worlds, and define a general method for transferring concepts and results between TQT and QST, thereby significantly increasing the expressive power of both approaches. Along the way, we develop a novel connection to paraconsistent logic and introduce a new class of structures that have significant implications for recent work on paraconsistent set theory. (shrink)

It seems that the Truth-teller is either true or false, but there is no accepted principle determining which it is. From this point of view, the Truth-teller is a hypodox. A hypodox is a conundrum like a paradox, but consistent. Sometimes, accepting an additional principle will convert a hypodox into a paradox. Conversely, in some cases, retracting or restricting a principle will convert a paradox to a hypodox. This last point suggests a new method of avoiding inconsistency. This article provides (...) a significant example. The Liar paradox can be defused to a hypodox by relatively minimally restricting three principles: the T-schema, substitution of identicals and universal instantiation. These restrictions are not arbitrary. For each, I identify the source of a contradiction given some presumptions. Then I propose each restriction as a reasonable way to deal with that source of contradiction. (shrink)

This paper explores allowing truth value assignments to be undetermined or "partial" and overdetermined or "inconsistent", thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate (...) twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson 's "constructible falsity". (shrink)

Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. But (...) the 4-valued logic is deductive in nature, and its matrix is discrete: there are just four values. In this paper I investigate embedding the 4-valued logic into a context of probability. Jøsang's Subjective Logic introduced uncertainty to allow for degrees of belief, disbelief, and uncertainty. We extend this so as to allow for two kinds of uncertainty— that in which the reasoner has too little information (ignorance) and that in which the reasoner has too much information (conflicted). Jøsang's "Opinion Triangle" becomes an "Opinion Tetrahedron" and the 4-values can be seen as its vertices. I make/prove various observations concerning the relation of non-classical "probability" to non-classical logic. (shrink)

Richard Sylvan (né Routley) was one of Australasia's most prolific and systematic philosophers. Though known for his innovative work in logic and metaphysics, the astonishing breadth of his philosophical endeavours included almost all reaches of philosophy. Taking the view that very basic assumptions of mainstream philosophy were fundamentally mistaken, he sought radical change across a wide range of theories. However, his view of the centrality of logic and recognition of the possibilities opened up by logical innovation in the fundamental areas (...) of metaphysics resulted in his working primarily in these two, closely connected fields. It is this work in logic and metaphysics that is the main focus of what follows. (shrink)

The present article critically examines three aspects of Graham Priest's dialetheic analysis of very important kinds of limitations (the limit of what can be expressed, described, conceived, known, or the limit of some operation or other). First, it is shown that Priest's considerations focusing on Hegel's account of the infinite cannot be sustained, mainly because Priest seems to rely on a too restrictive notion of object. Second, we discuss Priest's treatment of the paradoxes in Cantorian set-theory. It is shown that (...) Priest does not address the issue in full generality; rather, he relies on a reading of Cantor which implicitly attributes a very strong principle concerning quantification over arbitrary domains to Cantor. Third, the main piece of Priest's work, the so-called “inclosure schema”, is investigated. This schema is supposed to formalize the core of many well-known paradoxes. We claim, however, that formally the schema is not sound. (shrink)

Intra-theoretical logical pluralism is a form of meaning-invariant pluralism about logic, articulated recently by Hjortland :355–373, 2013). This version of pluralism relies on it being possible to define several distinct notions of provability relative to the same logical calculus. The present paper picks up and explores this theme: How can a single logical calculus express several different consequence relations? The main hypothesis articulated here is that the divide between the internal and external consequence relations in Gentzen systems generates a form (...) of intra-theoretical logical pluralism. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

Logical nihilism is the view that the relation of logical consequence is empty: there are counterexamples to any putative logical law. In this paper, I argue that the nihilist threat is illusory. The nihilistic arguments do not work. Moreover, the entire project is based on a misguided interpretation of the generality of logic.

Reflective equilibrium, as a methodology for the "formation of logics," fails on the *fringe*, where intricate details can make or break a logical theory. On the fringe, the process of theorification cannot be methodologically governed by anything like reflective equilibrium. When logical theorising gets tricky, there is nothing on the pre-theoretical side on which our theoretical claims can reflect of---at least not in any meaningful way. Indeed, the fringe is exclusively the domain of theoretical negotiations and the methodological power of (...) reflective equilibrium is merely nominal. (shrink)

In the original publication of the article, in Definition 4, the sixth line which reads as.

There is a relatively recent trend in treating negation as a modal operator. One such reason is that doing so provides a uniform semantics for the negations of a wide variety of logics and arguably speaks to a longstanding challenge of Quine put to non-classical logics. One might be tempted to draw the conclusion that negation is a modal operator, a claim Francesco Berto, 761–793, 2015) defends at length in a recent paper. According to one such modal account, the negation (...) of a sentence is true at a world x just in case all the worlds at which the sentence is true are incompatible with x. Incompatibility is taken to be the key notion in the account, and what minimal properties a negation has comes down to which minimal conditions incompatibility satisfies. Our aims in this paper are twofold. First, we wish to point out problems for the modal account that make us question its tenability on a fundamental level. Second, in its place we propose an alternative, non-modal, account of negation as a contradictory-forming operator that we argue is superior to, and more natural than, the modal account. (shrink)

This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the (...) field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new log- ics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite (...) logical matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic s5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

In our introduction we make some remarks on the main topics of this issue: assertion and proof. We briefly describe how each of the papers in the present publication has contributed from either different or complementary perspectives to the logical reflection on assertion and proof, while also specifying the relation between them.

In this paper we first develop a Dialetheic Logic with Exclusive Assumptions and Conclusions, DLEAC. We adopt the semantics of the logic of paradox (LP) extended with a notion of model suitable for DLEAC, and we modify its proof theory by refining the notions of assumption and conclusion, which are understood as speech acts. We introduce a new paradox – the rejectability paradox – first informally, then formally. We then provide its derivation in an extension of DLEAC contanining the rejectability (...) predicate. (shrink)

Counterpossibles are counterfactuals with necessarily false antecedents. The problem of counterpossibles is easiest to state within the "nearest possible world" framework for counterfactuals: on this approach, a counterfactual is true (roughly) when the consequent is true in the "nearest" possible world where the antecedent is true. Since counterpossibles have necessarily false antecedents, there is no possible world where the antecedent is true. On the approach favored by Lewis, Stalnaker, Williamson, and others, counterpossibles are all trivially true. I introduce several arguments (...) against the trivial approach. First, it is counter-intuitive to think that all counterpossibles are true. Second, if all counterpossibles were true, then we could not make sense of their use in logical, philosophical, or mathematical arguments. Making sense of the role of sentences like these requires that they not have vacuous truth conditions. The account of counterpossibles I ultimately favor is an extension of the "nearest possible world" semantics discussed above. The Lewis/Stalnaker account is supplemented with the addition of impossible worlds, and the nearness metric is extended to range over these impossible worlds as well as possible worlds. Thus, a counterfactual is true when its consequent is true in the nearest world where the antecedent is true; if the counterfactual's antecedent is impossible, then the nearest world in question will be an impossible world. Once the framework of impossible worlds and similarity is in place, we can put it to use in the analysis of other philosophical phenomena. I examine one proposal that makes use of a theory of counterpossibles to develop an analysis of the notion of metaphysical dependence. (shrink)

This paper briefly outlines some advancements in paraconsistent logics for modelling knowledge representation and reasoning. Emphasis is given on the so-called Logics of Formal Inconsistency (LFIs), a class of paraconsistent logics that formally internalize the very concept(s) of consistency and inconsistency. A couple of specialized systems based on the LFIs will be reviewed, including belief revision and probabilistic reasoning. Potential applications of those systems in the AI area of KRR are tackled by illustrating some examples that emphasizes the importance of (...) a fine-tuned treatment of consistency in modelling reputation systems, preferences, argumentation, and evidence. (shrink)

Approaches to truth and the Liar paradox seem invariably to face a dilemma: either appeal to some sort of hierarchy, or declare apparently perfectly coherent concepts incoherent. But since both options lead to severe expressive restrictions, neither seems satisfactory. The aim of this paper is a new approach, which avoids the dilemma and the resulting expressive restrictions. Previous approaches tend to appeal to some new sort of semantic value for the truth predicate to take. I argue that such approaches inevitably (...) lead to the dilemma in question. In contrast, the present proposal sticks with classical semantic values, but allows the compositional rules associated with these to admit of exceptions. I show how such an approach can be developed systematically. (shrink)

This paper explores early Australasian philosophy in some detail. Two approaches have dominated Western philosophy in Australia: idealism and materialism. Idealism was prevalent between the 1880s and the 1930s, but dissipated thereafter. Idealism in Australia often reflected Kantian themes, but it also reflected the revival of interest in Hegel through the work of ‘absolute idealists’ such as T. H. Green, F. H. Bradley, and Henry Jones. A number of the early New Zealand philosophers were also educated in the idealist tradition (...) and were influential in their communities, but produced relatively little. In Australia, materialism gained prominence through the work of John Anderson, who arrived in Australia in 1927, and continues to be influential. John Anderson had been a student of Henry Jones, who might therefore be said to have influenced both main strands of Australian philosophical thought. (shrink)