48 found

Year:

Forthcoming articles
  1. Joongol Kim (forthcoming). A Logical Foundation of Arithmetic. Studia Logica:1-32.
    The aim of this paper is to shed new light on the logical roots of arithmetic by presenting a logical framework (ALA) that takes seriously ordinary locutions like ‘at least n Fs’, ‘n more Fs than Gs’ and ‘n times as many Fs as Gs’, instead of paraphrasing them away in terms of expressions of the form ‘the number of Fs’. It will be shown that the basic concepts of arithmetic can be intuitively defined in the language of ALA, and (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Paul D. Thorn & Gerhard Schurz (forthcoming). A Utility Based Evaluation of Logico-Probabilistic Systems. Studia Logica:1-24.
    Systems of logico-probabilistic (LP) reasoning characterize inference from conditional assertions interpreted as expressing high conditional probabilities. In the present article, we investigate four prominent LP systems (namely, systems O, P, Z, and QC) by means of computer simulations. The results reported here extend our previous work in this area, and evaluate the four systems in terms of the expected utility of the dispositions to act that derive from the conclusions that the systems license. In addition to conforming to the dominant (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Matthias Unterhuber & Gerhard Schurz (forthcoming). Completeness and Correspondence in Chellas–Segerberg Semantics. Studia Logica:1-21.
    We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. M. Baaz & A. Leitsch (forthcoming). Cut-Elimination: Syntax and Semantics. Studia Logica:1-28.
    In this paper we first give a survey of reductive cut-elimination methods in classical logic. In particular we describe the methods of Gentzen and Schütte-Tait from the abstract point of view of proof reduction. We also present the method CERES (cut-elimination by resolution) which we classify as a semi-semantic method. In a further section we describe the so-called semantic methods. In the second part of the paper we carry the proof analysis further by generalizing the CERES method to CERESD (this (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Ermanno Bencivenga (forthcoming). Jaśkowski's Universally Free Logic. Studia Logica:1-8.
    A universally free logic is a system of quantification theory, with or without identity, whose theses remain logically true if (a) the domain of quantification is empty and (b) some of the singular terms present in the language do not denote existing objects. In the West, (inclusive) logics satisfying (a) and (free) ones satisfying (b) were developed starting in the 1950s. But Stanisław Jaśkowski preceded all this work by some twenty years: his paper “On the Rules of Supposition in Formal (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Agata Ciabattoni, Revantha Ramanayake & Heinrich Wansing (forthcoming). Hypersequent and Display Calculi – a Unified Perspective. Studia Logica:1-50.
    This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics. In contrast with existing surveys dedicated to hypersequent calculi or to display calculi, our aim is to provide a unified perspective on these two formalisms highlighting their differences and similarities and discussing applications and recent results connecting and comparing them.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Allen P. Hazen & Francis Jeffry Pelletier (forthcoming). Gentzen and Jaśkowski Natural Deduction: Fundamentally Similar but Importantly Different. Studia Logica:1-40.
    Gentzen’s and Jaśkowski’s formulations of natural deduction are logically equivalent in the normal sense of those words. However, Gentzen’s formulation more straightforwardly lends itself both to a normalization theorem and to a theory of “meaning” for connectives (which leads to a view of semantics called ‘inferentialism’). The present paper investigates cases where Jaskowski’s formulation seems better suited. These cases range from the phenomenology and epistemology of proof construction to the ways to incorporate novel logical connectives into the language. We close (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Andrzej Indrzejczak (forthcoming). Introduction. Studia Logica:1-4.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Peter Schroeder-Heister (forthcoming). The Calculus of Higher-Level Rules, Propositional Quantification, and the Foundational Approach to Proof-Theoretic Harmony. Studia Logica:1-32.
    We present our calculus of higher-level rules, extended with propositional quantification within rules. This makes it possible to present general schemas for introduction and elimination rules for arbitrary propositional operators and to define what it means that introductions and eliminations are in harmony with each other. This definition does not presuppose any logical system, but is formulated in terms of rules themselves. We therefore speak of a foundational (rather than reductive) account of proof-theoretic harmony. With every set of introduction rules (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Matthias Unterhuber & Gerhard Schurz (forthcoming). Logic and Probability: Reasoning in Uncertain Environments – Introduction to the Special Issue. Studia Logica:1-9.
    The current special issue focuses on logical and probabilistic approaches to reasoning in uncertain environments, both from a formal, conceptual and argumentative perspective as well as an empirical point of view. In the present introduction we give an overview of the types of problems addressed by the individual contributions of the special issue, based on fundamental distinctions employed in this area. We furthermore describe some of the general features of the special issue.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Jan von Plato (forthcoming). From Axiomatic Logic to Natural Deduction. Studia Logica:1-18.
    Recently discovered documents have shown how Gentzen had arrived at the final form of natural deduction, namely by trying out a great number of alternative formulations. What led him to natural deduction in the first place, other than the general idea of studying “mathematical inference as it appears in practice,” is not indicated anywhere in his publications or preserved manuscripts. It is suggested that formal work in axiomatic logic lies behind the birth of Gentzen’s natural deduction, rather than any single (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. William Young (forthcoming). From Interior Algebras to Unital ℓ-Groups: A Unifying Treatment of Modal Residuated Lattices. Studia Logica:1-22.
    Much work has been done on specific instances of residuated lattices with modal operators (either nuclei or conuclei). In this paper, we develop a general framework that subsumes three important classes of modal residuated lattices: interior algebras, Abelian ℓ-groups with conuclei, and negative cones of ℓ-groups with nuclei. We then use this framework to obtain results about these three cases simultaneously. In particular, we show that a categorical equivalence exists in each of these cases. The approach used here emphasizes the (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. A. M. Suardiaz A. Quantifier (forthcoming). M. Abad Varieties of Three-Valued. Studia Logica.
     
    My bibliography  
     
    Export citation  
  14. Peter Aczel, Benno van den Berg, Johan Granström & Peter Schuster (forthcoming). Are There Enough Injective Sets? Studia Logica.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. H. Arlo-Costa (forthcoming). First-Order Modal Logic', to Appear in V. Hendricks & SA Pedersen, Eds.,'40 Years of Possible Worlds', Special Issue Of. Studia Logica.
    No categories
     
    My bibliography  
     
    Export citation  
  16. T. S. Blyth, Jie Fang & Lei-bo Wang (forthcoming). De Morgan Algebras with a Quasi-Stone Operator. Studia Logica:1-16.
    We investigate the class of those algebras (L; º, *) in which (L; º) is a de Morgan algebra, (L; *) is a quasi-Stone algebra, and the operations ${x \mapsto x^{\circ}}$ and ${x \mapsto x^{*}}$ are linked by the identity x**º = x*º*. We show that such an algebra is subdirectly irreducible if and only if its congruence lattice is either a 2-element chain or a 3-element chain. In particular, there are precisely eight non-isomorphic subdirectly irreducible Stone de Morgan algebras.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. D. Busneag & M. Ghita (forthcoming). Some Properties of Epimorphisms of Implicative Algebras. Studia Logica.
     
    My bibliography  
     
    Export citation  
  18. A. V. Chagrov & M. V. Zakharyaschev (forthcoming). Modal Companions of Intermediate Logics: A Survey. Studia Logica.
     
    My bibliography  
     
    Export citation  
  19. Frank Wolter First Order Common (forthcoming). Knowledge Logics. Studia Logica.
     
    My bibliography  
     
    Export citation  
  20. Shan Du (forthcoming). On Pretabular Logics in NExtK4 (Part II). Studia Logica:1-24.
    In this paper we prove the pretabularity criteria for the logics of infinite depth in NExtK4. Then we use the criteria to resolve the problems of pretabular logics in NExtQ4 and prove that there is a continuum of pretabular logics in NExtQ4 just like NExtK4.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Dorothy Edgington (forthcoming). Estimating Conditional Chances and Evaluating Counterfactuals. Studia Logica:1-17.
    The paper addresses a puzzle about the probabilistic evaluation of counterfactuals, raised by Ernest Adams as a problem for his own theory. I discuss Brian Skyrms’s response to the puzzle. I compare this puzzle with other puzzles about counterfactuals that have arisen more recently. And I attempt to solve the puzzle in a way that is consistent with Adams’s proposal about counterfactuals.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Josep Maria Font & Tommaso Moraschini (forthcoming). M-Sets and the Representation Problem. Studia Logica:1-31.
    The “representation problem” in abstract algebraic logic is that of finding necessary and sufficient conditions for a structure, on a well defined abstract framework, to have the following property: that for every structural closure operator on it, every structural embedding of the expanded lattice of its closed sets into that of the closed sets of another structural closure operator on another similar structure is induced by a structural transformer between the base structures. This question arose from Blok and Jónsson abstract (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Rohan French (forthcoming). In the Mood for S4: The Expressive Power of the Subjunctive Modal Language in Weak Background Logics. Studia Logica:1-25.
    Our concern here is with the extent to which the expressive equivalence of Wehmeier’s Subjunctive Modal Language (SML) and the Actuality Modal Language (AML) is sensitive to the choice of background modal logic. In particular we will show that, when we are enriching quantified modal logics weaker than S5, AML is strictly expressively stronger than SML, this result following from general considerations regarding the relationship between operators and predicate markers. This would seem to complicate arguments given in favour of SML (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. D. Gabbay & F. Pirri (forthcoming). Special Issue on Combining Logics, Volume 59 (1, 2) Of. Studia Logica.
     
    My bibliography  
     
    Export citation  
  25. David R. Gilbert & Paolo Maffezioli (forthcoming). Modular Sequent Calculi for Classical Modal Logics. Studia Logica:1-43.
    This paper develops sequent calculi for several classical modal logics. Utilizing a polymodal translation of the standard modal language, we are able to establish a base system for the minimal classical modal logic E from which we generate extensions (to include M, C, and N) in a modular manner. Our systems admit contraction and cut admissibility, and allow a systematic proof-search procedure of formal derivations.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Dov Guido Boella, Leendert der Torre M. Gabbavany & Serena Villata (forthcoming). Meta-Argumentation Modelling I: Methodology and Techniques. Studia Logica.
    In this paper, we introduce the methodology and techniques of meta-argumentation to model argumentation. The methodology of meta-argumentation instantiates Dung’s abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung’s basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung’s theory of abstract argumentation to itself, by instantiating Dung’s abstract arguments with meta-arguments using a technique called flattening. (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  27. Sven Ove Hansson (forthcoming). Descriptor Revision. Studia Logica:1-26.
    A descriptor is a set of sentences that are truth-functional combinations of expressions of the form ${\mathfrak{B}p}$ B p , where ${\mathfrak{B}}$ B is a metalinguistic belief predicate and p a sentence in the object language in which beliefs are expressed. Descriptor revision (denoted ${\circ}$ ∘ ) is an operation of belief change that takes us from a belief set K to a new belief set ${K \circ \Psi}$ K ∘ Ψ where ${\Psi}$ Ψ is a descriptor representing the success (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. James Hawthorne (forthcoming). A Primer on Rational Consequence Relations, Popper Functions, and Their Ranked Structures. Studia Logica:1-19.
    Rational consequence relations and Popper functions provide logics for reasoning under uncertainty, the former purely qualitative, the latter probabilistic. But few researchers seem to be aware of the close connection between these two logics. I’ll show that Popper functions are probabilistic versions of rational consequence relations. I’ll not assume that the reader is familiar with either logic. I present them, and explicate the relationship between them, from the ground up. I’ll also present alternative axiomatizations for each logic, showing them to (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  29. Simon M. Huttegger & Brian Skyrms (forthcoming). Learning to Transfer Information. Studia Logica.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. Thomas Icard (forthcoming). Exclusion and Containment in Natural Language. Studia Logica.
     
    My bibliography  
     
    Export citation  
  31. Andrzej Indrzejczak (forthcoming). A Survey of Nonstandard Sequent Calculi. Studia Logica:1-28.
    The paper is a brief survey of some sequent calculi (SC) which do not follow strictly the shape of sequent calculus introduced by Gentzen. We propose the following rough classification of all SC: Systems which are based on some deviations from the ordinary notion of a sequent are called generalised; remaining ones are called ordinary. Among the latter we distinguish three types according to the proportion between the number of primitive sequents and rules. In particular, in one of these types, (...)
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Gabriele Kern-Isberner & Christian Eichhorn (forthcoming). Structural Inference From Conditional Knowledge Bases. Studia Logica:1-19.
    There are several approaches implementing reasoning based on conditional knowledge bases, one of the most popular being System Z (Pearl, Proceedings of the 3rd conference on theoretical aspects of reasoning about knowledge, TARK ’90, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 121–135, 1990). We look at ranking functions (Spohn, The Laws of Belief: Ranking Theory and Its Philosophical Applications, Oxford University Press, Oxford, 2012) in general, conditional structures and c-representations (Kern-Isberner, Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  33. Jarmo Kontinen (forthcoming). Coherence and Complexity of Quantifier-Free Dependence Logic Formulas. Studia Logica.
     
    My bibliography  
     
    Export citation  
  34. AgneS Kurucz & Arrow Logic (forthcoming). Infinite Counting. Studia Logica.
     
    My bibliography  
     
    Export citation  
  35. Brian Leahy, Eva Rafetseder & Josef Perner (forthcoming). Basic Conditional Reasoning: How Children Mimic Counterfactual Reasoning. Studia Logica:1-18.
    Children approach counterfactual questions about stories with a reasoning strategy that falls short of adults’ Counterfactual Reasoning (CFR). It was dubbed “Basic Conditional Reasoning” (BCR) in Rafetseder et al. (Child Dev 81(1):376–389, 2010). In this paper we provide a characterisation of the differences between BCR and CFR using a distinction between permanent and nonpermanent features of stories and Lewis/Stalnaker counterfactual logic. The critical difference pertains to how consistency between a story and a conditional antecedent incompatible with a nonpermanent feature of (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Marek Nowak (forthcoming). A Proof of Tarski's Fixed Point Theorem by Application of Galois Connections. Studia Logica:1-15.
    Two examples of Galois connections and their dual forms are considered. One of them is applied to formulate a criterion when a given subset of a complete lattice forms a complete lattice. The second, closely related to the first, is used to prove in a short way the Knaster-Tarski’s fixed point theorem.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. Sergei P. Odintsov & Heinrich Wansing (forthcoming). The Logic of Generalized Truth Values and the Logic of Bilattices. Studia Logica:1-22.
    This paper sheds light on the relationship between the logic of generalized truth values and the logic of bilattices. It suggests a definite solution to the problem of axiomatizing the truth and falsity consequence relations, \({\models_t}\) and \({\models_f}\) , considered in a language without implication and determined via the truth and falsity orderings on the trilattice SIXTEEN 3 (Shramko and Wansing, J Philos Logic, 34:121–153, 2005). The solution is based on the fact that a certain algebra isomorphic to SIXTEEN 3 (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. Gillman Payette & Peter K. Schotch (forthcoming). Remarks on the Scott–Lindenbaum Theorem. Studia Logica:1-18.
    In the late 1960s and early 1970s, Dana Scott introduced a kind of generalization (or perhaps simplification would be a better description) of the notion of inference, familiar from Gentzen, in which one may consider multiple conclusions rather than single formulas. Scott used this idea to good effect in a number of projects including the axiomatization of many-valued logics (of various kinds) and a reconsideration of the motivation of C.I. Lewis. Since he left the subject it has been vigorously prosecuted (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Arthur Paul Pedersen (forthcoming). An Extension Theorem and a Numerical Representation Theorem for Qualitative Comparative Expectations. Studia Logica.
     
    My bibliography  
     
    Export citation  
  40. Dana Piciu & A. Jeflea (forthcoming). Localization of MTL-Algebras. Studia Logica.
    Direct download  
     
    My bibliography  
     
    Export citation  
  41. J. Rasga, A. Sernadas & C. Sernadas (forthcoming). Fibring as Biporting Subsumes Asymmetric Combinations. Studia Logica:1-34.
    The transference of preservation results between importing (a logic combination mechanism that subsumes several asymmetrical mechanisms for combining logics like temporalization, modalization and globalization) and unconstrained fibring is investigated. For that purpose, a new (more convenient) formulation of fibring, called biporting, is introduced, and importing is shown to be subsumed by biporting. In consequence, particular cases of importing, like temporalization, modalization and globalization are subsumed by fibring. Capitalizing on these results, the preservation of the finite model property by fibring is (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  42. F. Sebastiani (forthcoming). A Fully Model-Theoretic Semantics for Model-Preference Default Systems', Istituto di Elaborazione dell'Informazione, Pisa. Studia Logica.
     
    My bibliography  
     
    Export citation  
  43. Angelina Ilić Stepić & Zoran Ognjanović (forthcoming). Logics for Reasoning About Processes of Thinking with Information Coded by P-Adic Numbers. Studia Logica:1-30.
    In this paper we present two types of logics (denoted \({L^{D}_{Q_{p}}}\) and \({L^{\rm thinking}_{Z_{p}}}\) ) where certain p-adic functions are associated to propositional formulas. Logics of the former type are p-adic valued probability logics. In each of these logics we use probability formulas K r,ρ α and D ρ α,β which enable us to make sentences of the form “the probability of α belongs to the p-adic ball with the center r and the radius ρ”, and “the p-adic distance between (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. L. Tatjana & I. Boris (forthcoming). In Databases* T. Studia Logica.
     
    My bibliography  
     
    Export citation  
  45. Hans van Ditmarsch (forthcoming). Johan van Benthem, Modal Logic for Open Minds, CSLI Lecture Notes, Stanford University, 2010, Pp. 350. ISBN: 9781575865997 (Hardcover) US 70.00,ISBN:9781575865980(Paperback)US 30.00. [REVIEW] Studia Logica.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Y. Venema (forthcoming). Meeting Strength in Substructural Logics'. UU Logic Preprint. Studia Logica.
     
    My bibliography  
     
    Export citation  
  47. Dag Westerståhl & Jfak van Benthem (forthcoming). Directions in Generalized Quantifier Theory. Studia Logica.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Evgeny Zolin (forthcoming). Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi. Studia Logica:1-19.
    We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
 Previous issues
  
Next issues