View topic on PhilPapers for more information
Related categories

258 found
Order:
More results on PhilPapers
1 — 50 / 258
Material to categorize
  1. A Graph-Theoretic Method to Define Any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
    The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Two Indian Dialectical Logics: Saptabhangi and Catuskoti.Fabien Schang - 2010 - Journal of the Indian Council of Philosophical Research 27 (1):45-75.
    A rational interpretation is proposed for two ancient Indian logics: the Jaina saptabhaṅgī, and the Mādhyamika catuṣkoṭi. It is argued that the irrationality currently imputed to these logics relies upon some philosophical preconceptions inherited from Aristotelian metaphysics. This misunderstanding can be corrected in two steps: by recalling their assumptions about truth; by reconstructing their ensuing theory of judgment within a common conceptual framework.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. Non Classical Concept Representation and Reasoning in Formal Ontologies.Antonio Lieto - 2012 - Dissertation, Università Degli Studi di Salerno
    Formal ontologies are nowadays widely considered a standard tool for knowledge representation and reasoning in the Semantic Web. In this context, they are expected to play an important role in helping automated processes to access information. Namely: they are expected to provide a formal structure able to explicate the relationships between different concepts/terms, thus allowing intelligent agents to interpret, correctly, the semantics of the web resources improving the performances of the search technologies. Here we take into account a problem regarding (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences.Jared Millson - 2019 - Studia Logica:1-34.
    In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Composing Prototypes - AISC 18.Antonio Lieto & Gian Luca Pozzato - 2018 - In Proceedings of AISC 2018, 15th Annual Conference of the Italian Association for Cognitive Sciences The new era of Artificial Intelligence: a cognitive perspective. 27100 Pavia, Province of Pavia, Italy: pp. 8-10.
    Combining typical knowledge to generate novel concepts is an important creative trait of human cognition. Dealing with such ability requires, from an AI perspective, the harmonization of two conflicting requirements that are hardly accommodated in symbolic systems: the need of a syntactic compositionality (typical of logical systems) and that one concerning the exhibition of typicality effects (see Frixione and Lieto, 2012). In this work we provide a logical framework able to account for this type of human-like concept combination. We propose (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. A Description Logic of Typicality for Conceptual Combination.Antonio Lieto & Gian Luca Pozzato - 2018 - In Proceedings of ISMIS 18. Springer.
    We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of combining prototypical concepts, an open problem in the fields of AI and cognitive modelling. Our logic extends the logic of typicality ALC + TR, based on the notion of rational closure, by inclusions p :: T(C) v D (“we have probability p that typical Cs are Ds”), coming from the distributed semantics of probabilistic Description Logics. Additionally, it embeds a set of cognitive heuristics for concept (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  7. Genuine Process Logic.Wolfgang Sohst - 2017 - Collected Lectures of MoMo Berlin.
    The Genuine Process Logic described here (abbreviation: GPL) places the object-bound process itself at the center of formalism. It should be suitable for everyday use, i.e. it is not primarily intended for the formalization of computer programs, but instead, as a counter-conception to the classical state logics. The new and central operator of the GPL is an action symbol replacing the classical state symbols, e.g. of equivalence or identity. The complete renunciation of object-language state expressions also results in a completely (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Prospects for a Naive Theory of Classes.Hartry Field, Harvey Lederman & Tore Fjetland Øgaard - 2017 - Notre Dame Journal of Formal Logic 58 (4):461-506.
    The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  9. ‘Chasing’ the Diagram—the Use of Visualizations in Algebraic Reasoning.Silvia de Toffoli - 2017 - Review of Symbolic Logic 10 (1):158-186.
    The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will be argued that one (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. ”John P. Burgess, Philosophical Logic, Princeton University Press, 2009”. [REVIEW]Constantin C. Brîncuș - 2013 - Romanian Journal of Analytic Philosophy 8 (1):90-92.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Categorical Harmony and Path Induction.Patrick Walsh - 2017 - Review of Symbolic Logic 10 (2):301-321.
    This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony through category theory. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. On Classical and Quantum Logical Entropy.David Ellerman - manuscript
    The notion of a partition on a set is mathematically dual to the notion of a subset of a set, so there is a logic of partitions dual to Boole's logic of subsets (Boolean logic is usually mis-specified as "propositional" logic). The notion of an element of a subset has as its dual the notion of a distinction of a partition (a pair of elements in different blocks). Boole developed finite logical probability as the normalized counting measure on elements of (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  13. On Logical Relativity.Achille C. Varzi - 2002 - Philosophical Issues 12 (1):197-219.
    One logic or many? I say—many. Or rather, I say there is one logic for each way of specifying the class of all possible circumstances, or models, i.e., all ways of interpreting a given language. But because there is no unique way of doing this, I say there is no unique logic except in a relative sense. Indeed, given any two competing logical theories T1 and T2 (in the same language) one could always consider their common core, T, and settle (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   16 citations  
  14. The Basic Algebra of Game Equivalences.Valentin Goranko - 2003 - Studia Logica 75 (2):221-238.
    We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities. En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways game identities into modal formulae. The completeness proof is based on reduction of game terms to a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  15. On the Duality Between Existence and Information.David Ellerman - manuscript
    Recent developments in pure mathematics and in mathematical logic have uncovered a fundamental duality between "existence" and "information." In logic, the duality is between the Boolean logic of subsets and the logic of quotient sets, equivalence relations, or partitions. The analogue to an element of a subset is the notion of a distinction of a partition, and that leads to a whole stream of dualities or analogies--including the development of new logical foundations for information theory parallel to Boole's development of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  16. Punny Logic.Noah Greenstein - 2015 - Analysis 75 (3):359-362.
    Logic and humour tend to be mutually exclusive topics. Humour plays off ambiguity, while classical logic falters over it. Formalizing puns is therefore impossible, since puns have ambiguous meanings for their components. However, I will use Independence-Friendly logic to formally encode the multiple meanings within a pun. This will show a general strategy of how to logically represent ambiguity and reveals humour as an untapped source of novel logical structure.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. A Natural Deduction Relevance Logic.Fred Johnson - 1977 - The Bulletin of the Section of Logic 6 (4):164-168.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  18. A Categorial Approach to the Combination of Logics.Walter A. Carnielli & Marcelo E. Coniglio - 1999 - Manuscrito 22 (2):69-94.
    In this paper we propose a very general de nition of combination of logics by means of the concept of sheaves of logics. We first discuss some properties of this general definition and list some problems, as well as connections to related work. As applications of our abstract setting, we show that the notion of possible-translations semantics, introduced in previous papers by the first author, can be described in categorial terms. Possible-translations semantics constitute illustrative cases, since they provide a new (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  20. Translations Between Logical Systems: A Manifesto.Walter A. Carnielli & Itala Ml D'Ottaviano - 1997 - Logique Et Analyse 157:67-81.
    The main objective o f this descriptive paper is to present the general notion of translation between logical systems as studied by the GTAL research group, as well as its main results, questions, problems and indagations. Logical systems here are defined in the most general sense, as sets endowed with consequence relations; translations between logical systems are characterized as maps which preserve consequence relations (that is, as continuous functions between those sets). In this sense, logics together with translations form a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  21. A Logic for 'Because'.Benjamin Schnieder - 2011 - Review of Symbolic Logic 4 (3):445-465.
    In spite of its significance for everyday and philosophical discourse, the explanatory connective has not received much treatment in the philosophy of logic. The present paper develops a logic for based on systematic connections between and the truth-functional connectives.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   49 citations  
  22. Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  23. Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  24. Abstract Logic of Oppositions.Fabien Schang - 2012 - Logic and Logical Philosophy 21 (4):415--438.
    A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  25. 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   Download  
     
    Export citation  
     
    Bookmark  
  26. A Different Approach to Logic.Mauro Avon - 2011 - Dissertation,
    The paper is about an approach to logic that differs from the standard first-order logic and other known approaches. It should be a new approach the author has created proposing to obtain a general and unifying approach to logic and a faithful model of human mathematical deductive process. We list the most relevant features of the system. In first-order logic there exist two different concepts of term and formula, in place of these two concepts in our approach we have just (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. Rejection and Truth-Value Gaps.Fred Johnson - 1999 - Notre Dame Journal of Formal Logic 40 (4):574-577.
    A theorem due to Shoesmith and Smiley that axiomatizes two-valued multiple-conclusion logics is extended to partial logics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Combining Algebraizable Logics.A. Jánossy, Á Kurucz & Á. E. Eiben - 1996 - Notre Dame Journal of Formal Logic 37 (2):366-380.
    The general methodology of "algebraizing" logics is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics. The cocompleteness of this category as well as its isomorphism to the corresponding category of certain first-order theories are proved.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  29. Topological Aspects of Combinatorial Possibility.Thomas Mormann - 1997 - Logic and Logical Philosophy 5:75 - 92.
    The aim of this paper is to show that topology has a bearing on<br><br>combinatorial theories of possibility. The approach developed in this article is “mapping account” considering combinatorial worlds as mappings from individuals to properties. Topological structures are used to define constraints on the mappings thereby characterizing the “really possible” combinations. The mapping approach avoids the well-known incompatibility problems. Moreover, it is compatible with atomistic as well as with non-atomistic ontologies.It helps to elucidate the positions of logical atomism and monism (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. Complex Individuals and Multigrade Relations.Adam Morton - 1975 - Noûs 9 (3):309-318.
    I relate plural quantification, and predicate logic where predicates do not need a fixed number of argument places, to the part-whole relation. For more on these themes see later work by Boolos, Lewis, and Oliver & Smiley.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   34 citations  
  31. First- and Second-Order Logic of Mass Terms.Peter Roeper - 2004 - Journal of Philosophical Logic 33 (3):261-297.
    Provided here is an account, both syntactic and semantic, of first-order and monadic second-order quantification theory for domains that may be non-atomic. Although the rules of inference largely parallel those of classical logic, there are important differences in connection with the identification of argument places and the significance of the identity relation.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  32. Cut-Offs and Their Neighbors.Achille C. Varzi - 2003 - In Jc Beall (ed.), Liars and Heaps: New Essays on Paradox. Clarendon Press. pp. 24–38.
    In ‘Towards a Solution to the Sorites Paradox’, Graham Priest gives us a new account of the sorites based on fuzzy logic. The novelty lies in the suggestion that truth-value assignments should themselves be treated as fuzzy objects, i.e., objects about which we can make fuzzy identity statements. I argue that Priest’s solution does not have the explanatory force that Priest advocates. That is, it does not explain why we find the existence of a cut-off point counter-intuitive. I also argue (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. Complementary Logics for Classical Propositional Languages.Achille C. Varzi - 1992 - Kriterion - Journal of Philosophy 4 (1):20-24.
    In previous work, I introduced a complete axiomatization of classical non-tautologies based essentially on Łukasiewicz’s rejection method. The present paper provides a new, Hilbert-type axiomatization (along with related systems to axiomatize classical contradictions, non-contradictions, contingencies and non-contingencies respectively). This new system is mathematically less elegant, but the format of the inferential rules and the structure of the completeness proof possess some intrinsic interest and suggests instructive comparisons with the logic of tautologies.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Sulla relatività logica.Achille C. Varzi - 2004 - In Massimiliano Carrara & Pierdaniele Giaretta (eds.), Filosofia e logica. Rubbettino Editore. pp. 135–173.
    Italian translation of "On Logical Relativity" (2002), by Luca Morena.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
Free Logic
  1. Anselm's God in Isabelle/HOL.Ben Blumson - 2017 - Archive of Formal Proofs:9.
    Paul Oppenheimer and Edward Zalta's formalisation of Anselm's ontological argument for the existence of God is automated by embedding a free logic for definite descriptions within Isabelle/HOL.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Russell's Revenge: A Problem for Bivalent Fregean Theories of Descriptions.Jan Heylen - 2017 - Pacific Philosophical Quarterly 98 (4):636-652.
    Fregean theories of descriptions as terms have to deal with improper descriptions. To save bivalence various proposals have been made that involve assigning referents to improper descriptions. While bivalence is indeed saved, there is a price to be paid. Instantiations of the same general scheme, viz. the one and only individual that is F and G is G, are not only allowed but even required to have different truth values.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Quantificational Logic and Empty Names.Andrew Bacon - 2013 - Philosophers' Imprint 13.
    The result of combining classical quantificational logic with modal logic proves necessitism – the claim that necessarily everything is necessarily identical to something. This problem is reflected in the purely quantificational theory by theorems such as ∃x t=x; it is a theorem, for example, that something is identical to Timothy Williamson. The standard way to avoid these consequences is to weaken the theory of quantification to a certain kind of free logic. However, it has often been noted that in order (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   11 citations  
Fuzzy Logic
  1. Curry’s Paradox and Ω -Inconsistency.Andrew Bacon - 2013 - Studia Logica 101 (1):1-9.
    In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this paper I show that a number of logics are susceptible to a strengthened version of Curry's paradox. This can be adapted to provide a proof theoretic analysis of the omega-inconsistency in Lukasiewicz's continuum valued logic, allowing us to better evaluate which logics are suitable for a naïve truth theory. On this basis I identify two natural subsystems of Lukasiewicz logic which individually, but (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  2. Maximality in Finite-Valued Lukasiewicz Logics Defined by Order Filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - forthcoming - Journal of Logic and Computation.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.Matthias Baaz & Richard Zach - 2000 - In Peter G. Clote & Helmut Schwichtenberg (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. Berlin: Springer. pp. 187– 201.
    Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and complete, and (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  4. Completeness of a Hypersequent Calculus for Some First-Order Gödel Logics with Delta.Matthias Baaz, Norbert Preining & Richard Zach - 2006 - In 36th International Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings. Los Alamitos: IEEE Press.
    All first-order Gödel logics G_V with globalization operator based on truth value sets V C [0,1] where 0 and 1 lie in the perfect kernel of V are axiomatized by Ciabattoni’s hypersequent calculus HGIF.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Hans Kleine Büning (ed.), Computer Science Logic. CSL 1995. Selected Papers. Berlin: Springer. pp. 1--15.
    It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the authors' temporal (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Compact Propositional Gödel Logics.Matthias Baaz & Richard Zach - 1998 - In 28th IEEE International Symposium on Multiple-Valued Logic, 1998. Proceedings. Los Alamitos: IEEE Press. pp. 108-113.
    Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  8. Many-Valued Logics. A Mathematical and Computational Introduction.Luis M. Augusto - 2017 - London: College Publications.
    Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and they are (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. 4. Contradictorial Gradualism Vs. Discontinuism: Two Views On Fuzziness And The Transition Problem.Marcelo VÁsconez - 2006 - Logique Et Analyse 49 (195).
    The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. Some Strong Conditionals for Sentential Logics.Jason Zarri - manuscript
    In this article I define a strong conditional for classical sentential logic, and then extend it to three non-classical sentential logics. It is stronger than the material conditional and is not subject to the standard paradoxes of material implication, nor is it subject to some of the standard paradoxes of C. I. Lewis’s strict implication. My conditional has some counterintuitive consequences of its own, but I think its pros outweigh its cons. In any case, one can always augment one’s language (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  11. Fuzziness and the Sorites Paradox.Marcelo Vasconez - 2006 - Dissertation, Catholic University of Louvain
    The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. A Simple Logic for Comparisons and Vagueness.Theodore J. Everett - 2000 - Synthese 123 (2):263-278.
    This article provide an intuitive semantic account of a new logic for comparisons (CL), in which atomic statements are assigned both a classical truth-value and a “how much” value or extension in the range [0, 1]. The truth-value of each comparison is determined by the extensions of its component sentences; the truth-value of each atomic depends on whether its extension matches a separate standard for its predicate; everything else is computed classically. CL is less radical than Casari’s comparative logics, in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. Hedges: A Study in Meaning Criteria and the Logic of Fuzzy Concepts. [REVIEW]George Lakoff - 1973 - Journal of Philosophical Logic 2 (4):458 - 508.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   59 citations  
1 — 50 / 258