This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Siblings:

225 found
Order:
1 — 50 / 225
  1. Conservative Translations.Hércules A. Feitosa & Itala M. Loffredo D'Ottaviano - 2001 - Annals of Pure and Applied Logic 108 (1-3):205-227.
    In this paper we introduce the concept of conservative translation between logics. We present some necessary and sufficient conditions for a translation to be conservative and study some general properties of logical systems, these properties being characterized by the existence of conservative translations between the systems. We prove that the class constituted by logics and conservative translations between them determines a co-complete subcategory of the bi-complete category constituted by logics and translations.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2. On Free Annotated Algebras.Renato A. Lewin, Irene F. Mikenberg & Marı́a G. Schwarze - 2001 - Annals of Pure and Applied Logic 108 (1-3):249-259.
    In Lewin et al. 359–386) the authors proved that certain systems of annotated logics are algebraizable in the sense of Block and Rigozzi 396). Later in Lewin et al. the study of the associated quasi-varieties of annotated algebras is initiated. In this paper we continue the study of the these classes of algebras, in particular, we report some recent results about the free annotated algebras.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  3. M. Abad Varieties of Three-Valued.A. M. Suardiaz A. Quantifier - forthcoming - Studia Logica.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  4. Elements of Formal Logic. [REVIEW]E. J. A. - 1965 - Review of Metaphysics 19 (2):379-379.
  5. Proving Theorems of the Second Order Lambek Calculus in Polynomial Time.Erik Aarts - 1994 - Studia Logica 53 (3):373 - 387.
    In the Lambek calculus of order 2 we allow only sequents in which the depth of nesting of implications is limited to 2. We prove that the decision problem of provability in the calculus can be solved in time polynomial in the length of the sequent. A normal form for proofs of second order sequents is defined. It is shown that for every proof there is a normal form proof with the same axioms. With this normal form we can give (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6. On Three-Valued Moisil Algebras.M. Abad & L. Monteiro - 1984 - Logique Et Analyse 27 (8):407-414.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  7. Varieties of Three-Values Heyting Algebras with a Quantifier.Manuel Abad, J. P. Diaz Varela & L. A. Rueda - 2000 - Studia Logica 65 (2):181-198.
    This paper is devoted to the study of some subvarieties of the variety Q of Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q subscript 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Q is far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q subscript 3 and we construct (...)
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  8. Well (and Better) Quasi-Ordered Transition Systems.Parosh Aziz Abdulla - 2010 - Bulletin of Symbolic Logic 16 (4):457-515.
    In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering ; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also present better quasi-ordered transition systems (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  9. A Meta-Interpreter Based on Paraconsistent Legal Knowledge Engineering.Jair Minoro Abe & Leonardo Pujatti - 2001 - Logic and Logical Philosophy 9:129.
    The Legal Knowledge Engineering is a new topic of investigationof Artificial Intelligence. This paper discusses some relevant problems relatedto this new area in a summarized way. Within the Normative Law Theory,one question that arises naturally is that of contradiction, like for example:articles conflicting with other articles inside the same code, codes conflictingwith codes, codes conflicting with jurisprudence, and in general, treatmentswith conflicting propositions in Normative Law Theory. This paper suggeststo treat directly inconsistencies in the Legal Knowledge Engineering; thisengineering has as (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  10. Classical Recapture.Andrew Aberdein - 2001 - In V. Fano, M. Stanzione & G. Tarozzi (eds.), Prospettive Della Logica E Della Filosofia Della Scienza. Rubettino. pp. 11-18.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  11. Implication, Modality and Intension in Symbolic Logic.Leo Abraham - 1933 - The Monist 43 (1):119-153.
  12. Future Determination of Entities in Talmudic Public Announcement Logic.M. Abraham, I. Belfer, D. M. Gabbay & U. Schild - 2013 - Journal of Applied Logic 11 (1):63-90.
  13. Obligations and Prohibitions in Talmudic Deontic Logic.M. Abraham, D. M. Gabbay & U. Schild - 2011 - Artificial Intelligence and Law 19 (2-3):117-148.
    This paper examines the deontic logic of the Talmud. We shall find, by looking at examples, that at first approximation we need deontic logic with several connectives: O T A Talmudic obligation F T A Talmudic prohibition F D A Standard deontic prohibition O D A Standard deontic obligation. In classical logic one would have expected that deontic obligation O D is definable by $O_DA \equiv F_D\neg A$ and that O T and F T are connected by $O_TA \equiv F_T\neg (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  14. Classical Conservative Extensions of Lambek Calculus.V. Michele Abrusci - 2002 - Studia Logica 71 (3):277 - 314.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  15. Some Uses of Dilators in Combinatorial Problems. II.V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele - 1990 - Journal of Symbolic Logic 55 (1):32 - 40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  16. Schütte Kurt. Zur Widerspruchsfreiheit einer typenfreien Logik. Mathematische Annalen, Bd. 125 Heft 4 , S. 394–400.W. Ackermann - 1955 - Journal of Symbolic Logic 20 (1):67.
    Remove from this list   Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    My bibliography  
  17. Quine W. V.. Reduction to a Dyadic Predicate.Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):297.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18. Review: W. V. Quine, Reduction to a Dyadic Predicate; Alan Cobham, Reduction to a Symmetric Predicate. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):297-297.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  19. Widerspruchsfreier Aufbau der Logik I: Typenfreies System Ohne Tertium Non Datur.Wilhelm Ackermann - 1950 - Journal of Symbolic Logic 15 (1):33-57.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  20. The Fundamentals of General Logic.E. M. Adams - 1954 - Longmans, Green.
  21. On the Logic of High Probability.Ernest W. Adams - 1986 - Journal of Philosophical Logic 15 (3):255 - 279.
  22. The Logic of Conditionals.Ernest Adams, Ernest W. Adams, Jaakko Hintikka & Patrick Suppes - 1974 - Journal of Symbolic Logic 39 (3):609-611.
  23. A Note on Function Quantification.J. W. Addison & S. C. Kleene - 1958 - Journal of Symbolic Logic 23 (1):47-48.
  24. The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic, Madison 1978.John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen & Yiannis N. Moschovakis - 1979 - Journal of Symbolic Logic 44 (3):469-480.
  25. A Gentzen System Equivalent to the BCK-Logic'.R. Adillon & Ventura Verdú - 1996 - Bulletin of the Section of Logic 25 (2):73-79.
  26. A Pragmatic Logic for Commands.Melvin Joseph Adler - 1980 - John Benjamins.
    The purpose of this essay is to both discuss commands as a species of speech act and to discuss commands within the broader framework of how they are used and ...
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  27. The Contributions of Logic to the Foundations of Physics: Foreword. [REVIEW]Diederik Aerts, Sonja Smets & Jean P. Van Bendegem - 2010 - Studia Logica 95 (1-2):1-3.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  28. Consistency, Truth and Ontology.Evandro Agazzi - 2011 - Studia Logica 97 (1):7-29.
    After a brief survey of the different meanings of consistency, the study is restricted to consistency understood as non-contradiction of sets of sentences. The philosophical reasons for this requirement are discussed, both in relation to the problem of sense and the problem of truth. The issue of mathematical truth is then addressed, and the different conceptions of it are put in relation with consistency. The formal treatment of consistency and truth in mathematical logic is then considered, with particular attention paid (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29. Question–Answer Games.Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):265-288.
    We propose strategic games wherein the strategies consist of players asking each other questions and answering those questions. We study simplifications of such games wherein two players simultaneously ask each other a question that the opponent is then obliged to answer. The motivation for our research is to model conversation including the dynamics of questions and answers, to provide new links between game theory and dynamic logics of information, and to exploit the dynamic/strategic structure that, we think, lies implicitly inside (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  30. Quantified Coalition Logic.Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge - 2008 - Synthese 165 (2):269 - 294.
    We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as "every coalition satisfying property P can achieve φ" and "there exists a coalition C satisfying property P such that C can achieve φ". We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  31. Translating Non-Classical Logics Into Classical Logic by Using Hidden Variables.Juan C. Agudelo-Agudelo - 2017 - Logica Universalis 11 (2):205-224.
    Dyadic semantics is a sort of non-truth-functional bivalued semantics introduced in Caleiro et al. Logica Universalis, Birkhäuser, Basel, pp 169–189, 2005). Here we introduce an algorithmic procedure for constructing conservative translations of logics characterised by dyadic semantics into classical propositional logic. The procedure uses fresh propositional variables, which we call hidden variables, to represent the indeterminism of dyadic semantics. An alternative algorithmic procedure for constructing conservative translations of any finite-valued logic into classical logic is also introduced. In this alternative procedure (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  32. Probability Measures in the Logic of Nilpotent Minimum.Stefano Aguzzoli & Brunella Gerla - 2010 - Studia Logica 94 (2):151-176.
    We axiomatize the notion of state over finitely generated free NM-algebras, the Lindenbaum algebras of pure Nilpotent Minimum logic. We show that states over the free n -generated NM-algebra exactly correspond to integrals of elements of with respect to Borel probability measures.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  33. Algebraic Logic, Where Does It Stand Today?Tarek Sayed Ahmed - 2005 - Bulletin of Symbolic Logic 11 (4):465-516.
    This is a survey article on algebraic logic. It gives a historical background leading up to a modern perspective. Central problems in algebraic logic (like the representation problem) are discussed in connection to other branches of logic, like modal logic, proof theory, model-theoretic forcing, finite combinatorics, and Gödel’s incompleteness results. We focus on cylindric algebras. Relation algebras and polyadic algebras are mostly covered only insofar as they relate to cylindric algebras, and even there we have not told the whole story. (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    My bibliography   16 citations  
  34. On Neat Reducts of Algebras of Logic.Tarek Sayed Ahmed & Istvan Németi - 2001 - Studia Logica 68 (2):229-262.
    SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  35. An Omitting Types Theorem for First Order Logic with Infinitary Relation Symbols.Tarek Sayed Ahmed & Basim Samir - 2007 - Mathematical Logic Quarterly 53 (6):564-570.
    In this paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  36. Logic for Physical Space: From Antiquity to Present Days.Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko - 2012 - Synthese 186 (3):619-632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  37. Logic as the Science of the Pure Concept.Douglas Ainslie - 1920 - Philosophical Review 29 (3):283-288.
  38. The Axiomatic Systems From the Methodological Point of View.Kazimierz Ajdukiewicz - 1960 - Studia Logica 9 (1):205 - 220.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  39. Okres warunkowy a implikacja materialna / Conditional Sentence and Material Implication.Kazimierz Ajdukiewicz - 1956 - Studia Logica 4:117-153.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  40. The Gentzen-Kripke Construction of the Intermediate Logic LQ.Seiki Akama - 1991 - Notre Dame Journal of Formal Logic 33 (1):148-153.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. Subformula Semantics for Strong Negation Systems.Seiki Akama - 1990 - Journal of Philosophical Logic 19 (2):217 - 226.
    We present a semantics for strong negation systems on the basis of the subformula property of the sequent calculus. The new models, called subformula models, are constructed as a special class of canonical Kripke models for providing the way from the cut-elimination theorem to model-theoretic results. This semantics is more intuitive than the standard Kripke semantics for strong negation systems.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  42. Constructive Predicate Logic with Strong Negation and Model Theory.Seiki Akama - 1987 - Notre Dame Journal of Formal Logic 29 (1):18-27.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  43. Independence of the Primitive Symbols of Lewis's Calculi of Propositions.M. J. Alban - 1943 - Journal of Symbolic Logic 8 (1):25-26.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  44. Maps Between Some Different Kinds of Contraction Function: The Finite Case.Carlos E. Alchourrón & David Makinson - 1986 - Studia Logica 45 (2):187 - 198.
    In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  45. Proto-Semantics for Positive Free Logic.Antonelli G. Aldo - 2000 - Journal of Philosophical Logic 29 (3):277-294.
    This paper presents a bivalent extensional semantics for positive free logic without resorting to the philosophically questionable device of using models endowed with a separate domain of "non-existing" objects. The models here introduced have only one (possibly empty) domain, and a partial reference function for the singular terms (that might be undefined at some arguments). Such an approach provides a solution to an open problem put forward by Lambert, and can be viewed as supplying a version of parametrized truth non (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  46. Belief Ascription Under Bounded Resources.Natasha Alechina & Brian Logan - 2010 - Synthese 173 (2):179 - 197.
    There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of belief ascription in a resource-bounded setting. We show that for agents whose computational resources and memory are bounded, (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  47. A Predicate Logic Based on Indefinite Description and Two Notions of Identity.Robert A. Alps & Robert C. Neveln - 1981 - Notre Dame Journal of Formal Logic 22 (3):251-263.
  48. The Logic of Plurality.J. E. J. Altham - 1971 - London: Methuen.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  49. Independent Axiom Schemata for Von Wright's M.Alan Ross Anderson - 1957 - Journal of Symbolic Logic 22 (3):241-244.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  50. Independent Axiom Schemata for S.Alan Ross Anderson - 1956 - Journal of Symbolic Logic 21 (3):255-256.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 225