We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

This article focuses on the interpretation of the metaphysical deductions of the higher cognitive faculties in Gabriele Gava’s Kant’s Critique of Pure Reason and the Method of Metaphysics. The aim is to assess the role that Kant’s general logic plays in these metaphysical deductions, the consequences for the analysis of the faculties, and the place of general logic in Gava’s overall theoretical analysis of Kant’s first Critique.

In this paper I consider whether there is a measure of coherence that could be rightly claimed to generalize the notion of logical equivalence. I show that Fitelson’s (2003) proposal to that effect encounters some serious difficulties. Furthermore, there is reason to believe that no mutual-support measure could ever be suitable for the formalization of coherence as generalized logical equivalence. Instead, it appears that the only plausible candidate for such a measure is one of relative overlap. The measure I propose (...) in this paper is quite similar to Olsson’s (2002) proposal but differs from it by not being susceptible to the type of counterexample that Bovens and Hartmann (2003) have devised against it. (shrink)

There are two ways interpreters have tended to understand the nature of the laws of Kant’s pure general logic. On the first, these laws are unconditional norms for how we ought to think, and will govern anything that counts as thinking. On the second, these laws are formal criteria for being a thought, and violating them makes a putative thought not a thought. These traditions are in tension, in so far as the first depends on the possibility of thoughts (...) that violate these laws, and the second makes violation impossible. In this essay I develop an interpretation of Kant’s pure general logic that overcomes this tension. It accounts for the possibility of logical mistakes, as the first tradition does, while still establishing the absolute impossibility of logical aliens, as the second tradition does. I then argue that the formalist insight that illogical exercises of the understanding are not alternative ways coherent thoughts could have been, but are mere confusions, is fundamental for achieving a proper understanding of the absolute normativity of the laws of pure general logic. (shrink)

. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On the other (...) hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued (...) first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

The question motivating my investigation is: Are the basic philosophical principles underlying the "core" system of contemporary logic exhausted by the standard version? In particular, is the accepted narrow construal of the notion "logical term" justified? ;As a point of comparison I refer to systems of 1st-order logic with generalized quantifiers developed by mathematicians and linguists . Based on an analysis of the Tarskian conception of the role of logic I show that the standard division of terms into logical and (...) extra-logical is partly arbitrary. I argue that the semantic principles of Tarskian logic allow any higher order mathematical predicate or relation to function as a logical term in a 1st-order system, provided it is introduced in the right way into the syntactic-semantic apparatus. ;Formally, I propose a new, "constructive", semantic characterization of logical terms. A logical term is defined by a function which, given a model, "shows" how to construct relations, sets, or n-tuples of individuals which satisfy it. I discuss the linguistic applicability of the extended logic and bring numerous examples. ;One chapter is devoted to branching quantification--a non-standard logico-linguistic construction obtained by affixing a non-linear, partially-ordered quantifier-prefix to a well-formed formula. Although standard branching quantifiers were given a complete account by Henkin and Walkoe, it is not altogether clear what the meaning of branching generalized quantifiers is. I propose a new analysis of the generalized branching prefix which extends the existent, partial, definitions due to Barwise, and I develop a generalization leading to a "family" of branching structures. ;In conclusion I discuss the philosophical impact of the generalized conception of logic on such issues as the logicist thesis, the interaction between mathematics and logic, ontological commitment via logic, metaphysics and logical semantics. (shrink)

A common reaction to Hegel’s suggestion that we collapse Kant’s distinction between form and content is that, since such a move would also deprive us of any way of distinguishing the merely logical from the real possibility of our concepts, it is incoherent and ought to be rejected. It is true that these two distinctions are intimately related in Kant, such that if one goes, the other does as well. But it is less obvious that giving them up as Kant (...) conceives them is as incoherent a proposal as many of Hegel’s critics think. It has been the point of a recent account of Hegel’s idealism to demonstrate that his critique of Kant’s dichotomy between form and content or concept and intuition does not commit him to the view that human cognition is materially creative of its content in the manner of a God-like or intuitive intellect—does not, in other words, signify a return to a pre-Critical metaphysics. This is the interpretative stance I adopt here as well, in hope of giving defenders of Kant reasons for taking Hegel more seriously. (shrink)

In this paper, I consider the basis for Kant's praise of Wolff's general logic as "the best we have." I argue that Wolff's logic was highly esteemed by Kant on account of its novel analysis of the three operations of the mind (tres operationes mentis), in the course of which Wolff formulates an argument for the priority of the understanding's activity of judging.

This text centers around three main subjects. The first is the concept of modularity and independence in classical logic and nonmonotonic and other nonclassical logic, and the consequences on syntactic and semantical interpolation and language change. In particular, we will show the connection between interpolation for nonmonotonic logic and manipulation of an abstract notion of size. Modularity is essentially the ability to put partial results achieved independently together for a global result. The second aspect of the book is the authors' (...) uniform picture of conditionals, including many-valued logics and structures on the language elements themselves and on the truth value set. The third topic explained by the authors is neighbourhood semantics, their connection to independence, and their common points and differences for various logics, e.g., for defaults and deontic logic, for the limit version of preferential logics, and for general approximation"--Publisher. (shrink)

The class of equivalential logics comprises all implicative logics in the sense of Rasiowa [9], Suszko's logicSCI and many Others. Roughly speaking, a logic is equivalential iff the greatest strict congruences in its matrices (models) are determined by polynomials. The present paper is the first part of the survey in which systematic investigations into this class of logics are undertaken. Using results given in [3] and general theorems from the theory of quasi-varieties of models [5] we (...) give a characterization of all simpleC-matrices for any equivalential logicC (Theorem I.14). In corollaries we give necessary and sufficient conditions for the class of all simple models for a given equivalential logic to be closed under free products (Theorem I.18). (shrink)

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are (...) given. Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

The expression ‘free logic,’ coined by the author in 1960, is an abbreviation for ‘logic free of existence assumptions with respect to its terms, singular and general, but whose quantifiers are treated exactly as in standard quantifier logic.’ In more traditional language, such logics do not presume that either singular or general terms — the two distinct categories of terms emphasized in modern logical grammar — have existential import. A singular term ‘t’ has existential import just in (...) case t exists (or, equivalently, there exists an object the same as t) and a general term (or predicate) ‘G’ has existential import just in case G exist (or, equivalently, there exists an object that is G).1 Examples from colloquial English customarily taken to be singular terms are expressions such as ‘Socrates’, ‘the planet causing perturbations in the orbit of Mercury’, ‘5’, ‘5/0’, ‘the square of 3’ and ‘having a heart’. Some of these do not have existential import — in particular, ‘5/0’ and ‘the planet causing perturbations in the orbit of Mercury’. Examples from colloquial English customarily taken to be general terms are expressions such as ‘is a philosopher’, ‘is a planet causing perturbations in the orbit of Mercury’, ‘number’, ‘is divisible by 0’, and ‘has a heart’. Some of these general terms do not have existential import — in particular, ‘is a planet causing perturbations in the orbit of Mercury’ and ‘is divisible by 0’. To say that the quantifers are treated exactly as in standard quantifier logic is to say, roughly, that the operator symbol ‘∃’ (the existential quantifier) reads: ‘There exists an object’, and the operator symbol ‘∀’ (the universal quantifier) reads: ‘Every existent object’. (shrink)

In the Critique of Pure Reason, Kant uses the term “logic” in a bewildering variety of ways, at times making it close to impossible to determine whether he is referring to (among others) general logic, transcendental logic, transcendental analytic, a "special" logic relative to a specific science, a "natural" logic, a logic intended for the "learned" (Gelehrter), some hybrid of these logics, or even some still-more abstract notion that ranges over all of these uses. This paper seeks to (...) come to grips with Kant's complex use of "logic." Kant is standardly regarded as saying that since Aristotle, there need be no more concern about logic as a discipline or a field of study, and that Aristotle (with some minor embellishments, in terms of presentation) is the last word in logic. I argue here that, in spite of Hegel, Peirce, Strawson, and others, one must take into consideration Kant’s sophisticated critique of Aristotle’s logic in order to see Kant’s own conception of logic in contrast to that of Aristotle’s. In this way, Kant's strategy in the First Critique—grounded as it is in logic—becomes more plausible, defensible, and, consequently, more attractive. (shrink)

In the paper, I have presented a portrait of Jerzy Pelc as a teacher. He followed in the footsteps of Kazimierz Twardowski and his direct disciples and tried to develop his students’ skills of critical thinking and clear speaking—the basics of good work in philosophy. These skills are connected with methodological postulates of criticism and precision which were shared by all the members of the Lvov-Warsaw School. Jerzy Pelc treated these postulates also as didactic postulates arising out of the conceptions (...) of logical culture and general logic. In my article, I have sketched a general picture of the relation between logic and didactics, I have presented the aforementioned postulates, the concepts of logical culture and general logic and its curriculum. (shrink)

This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known (...) examples. Some philosophical morals are drawn concerning the possibility of having two logical systems that are "empirically distinct" but are both translationally equivalent to a common logic. (shrink)

Popper is well known for rejecting a logic of discovery, but he is only justified in rejecting the same type of logic of discovery that is denied by consequentialism. His own account of hypothesis generation, based on a natural selection analogy, involves an error-eliminative logic of discovery and the differences he admits between biological and conceptual evolution suggest an error-corrective logic of discovery. These types of logics of discovery are based on principles of plausibility that are used in the (...) generation as opposed to the preliminary evaluation of hypotheses. The normative relevance of these principles is grounded in the distinction between strategic and definitory rules. (shrink)

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures in (...) contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented. (shrink)

In this paper we make an attempt to study classes of models by using general logics. We do not believe that Lww is always the best logic for analyzing a class of models. Let K be a class of models and L a logic. The main assumptions we make about K and C are that K has the L-amalgamation property and, later in the paper, that K does not omit L-types. We show that, if modified suitably, most of (...) the results of stability theory hold in this context. The main difference is that existentially closed models of K play the role that arbitrary models play in traditional stability theory. We prove e. g. a structure theorem for the class of existentially closed models of K assuming that K is a trivial superstable class with ndop. (shrink)

Situation theory, and channel theory in particular, have been used to provide motivational accounts of the ternary relation semantics of relevant, substructural, and various non-classical logics. Among the constraints imposed by channel-theory, we must posit a certain existence criterion for situations which result from the composites of multiple channels (this is used in modeling information flow). In associative non-classical logics, it is relatively easy to show that a certain such condition is met, but the problem is trickier in (...) non-associative logics. Following Tedder (2017), where it was shown that the conjunction-conditional fragment of the logic B admits the existence of composite channels, I present a generalised ver- sion of the previous argument, appropriate to logics with disjunction, in the neighbourhood ternary relation semantic framework. I close by suggesting that the logic BB+(^I), which falls between Lavers' system BB+ and B+ , satisfies the conditions for the general argument to go through (and prove that it satisfies all but one of those conditions). (shrink)

Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.

Several justification logics have been created, starting with the logic LP, [1]. These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. We begin by sketching the basics of justification logics and their relations with modal logics. Then we move to new material. Modal logics come in various strengths. (...) For their corresponding justification logics, differing strength is reflected in different vocabularies. What we show here is that for justification logics corresponding to modal logics extending T, various familiar extensions are actually conservative with respect to each other. Our method of proof is very simple, and general enough to handle several justification logics not directly corresponding to distinct modal logics. Our methods do not, however, allow us to prove comparable results for justification logics corresponding to modal logics that do not extend T. That is, we are able to handle explicit logics of knowledge, but not explicit logics of belief. This remains open. (shrink)

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the (...) input/output system, considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

Fundamental properties of N-valued logics are compared and eleven theorems are presented for their Logic Algebras, including Łukasiewicz–Moisil Logic Algebras represented in terms of categories and functors. For example, the Fundamental Logic Adjunction Theorem allows one to transfer certain universal, or global, properties of the Category of Boolean Algebras,, (which are well-understood) to the more general category \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal L}$$\end{document}Mn of Łukasiewicz–Moisil Algebras. Furthermore, the relationships of LMn-algebras to other many-valued (...) logical structures, such as the n-valued Post, MV and Heyting logic algebras, are investigated and several pertinent theorems are derived. Applications of Łukasiewicz–Moisil Algebras to biological problems, such as nonlinear dynamics of genetic networks – that were previously reported – are also briefly noted here, and finally, probabilities are precisely defined over LMn-algebras with an eye to immediate, possible applications in biostatistics. (shrink)

It is a celebrated result of McKinsey and Tarski [28] thatS4is the logic of the closure algebraΧ+over any dense-in-itself separable metrizable space. In particular,S4is the logic of the closure algebra over the realsR, the rationalsQ, or the Cantor spaceC. By [5], each logic aboveS4that has the finite model property is the logic of a subalgebra ofQ+, as well as the logic of a subalgebra ofC+. This is no longer true forR, and the main result of [5] states that each connected (...) logic aboveS4with the finite model property is the logic of a subalgebra of the closure algebraR+.In this paper we extend these results to all logics aboveS4. Namely, for a normal modal logicL, we prove that the following conditions are equivalent: (i)Lis aboveS4, (ii)Lis the logic of a subalgebra ofQ+, (iii)Lis the logic of a subalgebra ofC+. We introduce the concept of a well-connected logic aboveS4and prove that the following conditions are equivalent: (i)Lis a well-connected logic, (ii)Lis the logic of a subalgebra of the closure algebra$\xi _2^ + $over the infinite binary tree, (iii)Lis the logic of a subalgebra of the closure algebra${\bf{L}}_2^ + $over the infinite binary tree with limits equipped with the Scott topology. Finally, we prove that a logicLaboveS4is connected iffLis the logic of a subalgebra ofR+, and transfer our results to the setting of intermediate logics.Proving these general completeness results requires new tools. We introduce the countable general frame property (CGFP) and prove that each normal modal logic has the CGFP. We introduce general topological semantics forS4, which generalizes topological semantics the same way general frame semantics generalizes Kripke semantics. We prove that the categories of descriptive frames forS4and descriptive spaces are isomorphic. It follows that every logic aboveS4is complete with respect to the corresponding class of descriptive spaces. We provide several ways of realizing the infinite binary tree with limits, and prove that when equipped with the Scott topology, it is an interior image of bothCandR. Finally, we introduce gluing of general spaces and prove that the space obtained by appropriate gluing involving certain quotients ofL2is an interior image ofR. (shrink)

In this paper we will study the properties of the least extension n(Λ) of a given intermediate logic Λ by a strong negation. It is shown that the mapping from Λ to n(Λ) is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n(Λ). This summarizes results that can be found already in [13, 14] and [4]. Furthermore, we (...) determine the structure of the lattice of extensions of n(LC). (shrink)

In Kant’s Critique of Pure Reason and the Method of Metaphysics (CUP 2023), I argue that the first Critique is not only a ‘propaedeutic’ to metaphysics, but actually already establishes parts of metaphysics. These parts belong to what Kant calls transcendental philosophy. Additionally, I also provide an account of Kant’s critique of dogmatism and Wolff as its main defender. In this paper, I take up Luigi Filieri’s and Davide Dalla Rosa’s invitation to further develop my characterization of transcendental philosophy and (...) I respond to Michael Walschots’s objections against my interpretation of Kant’s critique of Wolff’s dogmatism. (shrink)

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and (...) conservative translations between them. In this paper we present some conservative translations involving classical logic, Lukasiewicz three-valued system L3, the intuitionistic system I1 and several paraconsistent logics, as for instance Sette's system P1, the D'Ottaviano and da Costa system J3 and da Costa's systems Cn, 1≤ n≤ω. (shrink)

In this paper we define and study a generalized notion of a logical system that covers on an equal formal basis sentential, equational and sequential systems. We develop a general theory of equivalence between generalized logics that provides, first, a conception of algebraizable logic , second, a formal concept of equivalence between sequential systems and, third, a notion of equivalence between sentential and sequential systems. We also use our theory of equivalence for developing a general algebraic approach (...) to conjunctive non-pseudo-axiomatic self-extensional sentential logics. Finally, we consider within the framework of the mentioned approach various sequential formulations for some well-known sentential logics. (shrink)

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example (...) of what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

We show that every extension of the basic hybrid logic with modal Sahlqvist axioms is complete. As a corollary of our approach, we also obtain the Beth property for a large class of hybrid logics. Finally, we show that the new completeness result cannot be combined with the existing general completeness result for pure axioms.

Several justification logics have evolved, starting with the logicLP, (Artemov 2001). These can be thought of as explicit versions of modal logics, or logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected in different vocabularies. What we show here is that for justification logics corresponding to (...) modal logics extending T, various familiar extensions are actually conservative with respect to each other. Our method of proof is very simple, and general enough to handle several justification logics not directly corresponding to distinct modal logics. Our methods do not, however, allow us to prove comparable results for justification logics corresponding to modal logics that do not extend T. That is, we are able to handle explicit logics of knowledge, but not explicit logics of belief. This remains open. (shrink)

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar (...) logics with converse. The class of regular grammar logics includes numerous logics from various application domains. A consequence of the translation is that the general satisfiability problem for every regular grammar logics with converse is in EXPTIME. This extends a previous result of the first author for grammar logics without converse. Other logics that can be translated into GF2 include nominal tense logics and intuitionistic logic. In our view, the results in this paper show that the natural first-order fragment corresponding to regular grammar logics is simply GF2 without extra machinery such as fixed-point operators. (shrink)

In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way.

A range of formal models of human reasoning have been proposed in a number of fields such as philosophy, logic, artificial intelligence, computer science, psychology, cognitive science, etc.: various logics, probabilistic systems, belief revision systems, neural networks, among others. Now, it seems reasonable to require that formal models of human reasoning be empirically adequate if they are to be viewed as models of the phenomena in question. How are formal models of human reasoning typically put to empirical test? One (...) way to do so is to isolate a number of key principles of the system, and design experiments to gauge the extent to which participants do or do not follow them in reasoning tasks. Another way is to take relevant existing results and check whether a particular formal model predicts these results. The present investigation provides an illustration of the second kind of empirical testing by comparing two formal models for reasoning – namely the non-monotonic logic known as preferential logic; and a particular version of belief revision theories, screened belief revision – against the reasoning phenomenon known as belief bias in the psychology of reasoning literature: human reasoners typically seek to maintain the beliefs they already hold, and conversely to reject contradicting incoming information. The conclusion of our analysis will be that screened belief revision is more empirically adequate with respect to belief bias than preferential logic and non-monotonic logics in general, as what participants seem to be doing is above all a form of belief management on the basis of background knowledge. The upshot is thus that, while it may offer valuable insights into the nature of human reasoning, preferential logic is ultimately inadequate as a formal model of the phenomena in question. (shrink)

A range of formal models of human reasoning have been proposed in a number of fields such as philosophy, logic, artificial intelligence, computer science, psychology, cognitive science, etc.: various logics, probabilistic systems, belief revision systems, neural networks, among others. Now, it seems reasonable to require that formal models of human reasoning be empirically adequate if they are to be viewed as models of the phenomena in question. How are formal models of human reasoning typically put to empirical test? One (...) way to do so is to isolate a number of key principles of the system, and design experiments to gauge the extent to which participants do or do not follow them in reasoning tasks. Another way is to take relevant existing results and check whether a particular formal model predicts these results. The present investigation provides an illustration of the second kind of empirical testing by comparing two formal models for reasoning – namely the non-monotonic logic known as preferential logic; and a particular version of belief revision theories, screened belief revision – against the reasoning phenomenon known as belief bias in the psychology of reasoning literature: human reasoners typically seek to maintain the beliefs they already hold, and conversely to reject contradicting incoming information. The conclusion of our analysis will be that screened belief revision is more empirically adequate with respect to belief bias than preferential logic and non-monotonic logics in general, as what participants seem to be doing is above all a form of belief management on the basis of background knowledge. The upshot is thus that, while it may offer valuable insights into the nature of human reasoning, preferential logic is ultimately inadequate as a formal model of the phenomena in question. (shrink)