Results for 'a functionally complete set of logical quantifiers'

953 found
Order:
  1.  89
    Logic as an internal organisation of language.Boris Čulina - 2024 - Science and Philosophy 12 (1):62-71.
    Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical concepts -- logical constants, logical truths, and logical consequence -- are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. What is Logical in First-Order Logic?Boris Čulina - manuscript
    In this article, logical concepts are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which the universal and existential quantifiers form a functionally complete set of quantifiers. Neither equality nor cardinal quantifiers belong to the logical constants of a first-order language.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. A Semantics for the Impure Logic of Ground.Louis deRosset & Kit Fine - 2023 - Journal of Philosophical Logic 52 (2):415-493.
    This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review of Symbolic Logic, 5(1), 1–25, 2012a) sets out a system for the pure logic of ground, one in which the formulas between which ground-theoretic claims hold have no internal logical complexity; and it provides a sound and complete semantics for the system. Fine (2012b) [§§6-8] sets out a system for an impure logic of ground, one that extends the rules of the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  40
    Kripkenstein and Aborigines: The True Order of Language and Rule-Following Paradox.A. Nekhaev - 2013 - Tomsk State University Journal of Philosophy, Sociology and Political Science 7 (2):143-155.
    This article is devoted to thirtieth anniversary of the first publication in 1982 Saul Kripke's book "Wittgenstein on rules and private language". Radical skeptical interpretation of the work 'late' Ludwig Wittgenstein proposed by Saul Kripke in this book is considered one of the most famous "puzzle" of modern philosophy of language, which has become a source of much debate and discussion on the nature of the linguistic sign and its meaning. This article examines some of the consequences of a radical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Символічна логіка: повернення до витоків. Стаття ІІІ. Похідні логістичні категорії.Yaroslav Kokhan - 2021 - Multiversum. Philosophical Almanac 2 (2):141-155.
    The paper is Part III of the large research, dedicated to both the revision of the system of basic logical categories and the generalization of modern predicate logic to functional logic. We determinate and contrapose modern Fregean logistics and proposed by the author ultra-Fregean logistics, next we describe values and arguments of functions, arguments of relations, relations themselves, sets (classes), and subsets (subclasses) as derivative categories (concepts) of ultrafregean logistics. Logistics is a part of metalogic, independent of semantics. Fregean (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. From Bi-facial Truth to Bi-facial Proofs.Stefan Wintein & Reinhard A. Muskens - 2015 - Studia Logica 103 (3):545-558.
    In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of these (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  7. Post Completeness in Congruential Modal Logics.Peter Fritz - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 288-301.
    Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Analytic Tableaux for all of SIXTEEN 3.Stefan Wintein & Reinhard Muskens - 2015 - Journal of Philosophical Logic 44 (5):473-487.
    In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  9. On the Logics with Propositional Quantifiers Extending S5Π.Yifeng Ding - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. pp. 219-235.
    Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Deontic logic as a study of conditions of rationality in norm-related activities.Berislav Žarnić - 2016 - In Olivier Roy, Allard Tamminga & Malte Willer (eds.), Deontic Logic and Normative Systems. London, UK: College Publications. pp. 272-287.
    The program put forward in von Wright's last works defines deontic logic as ``a study of conditions which must be satisfied in rational norm-giving activity'' and thus introduces the perspective of logical pragmatics. In this paper a formal explication for von Wright's program is proposed within the framework of set-theoretic approach and extended to a two-sets model which allows for the separate treatment of obligation-norms and permission norms. The three translation functions connecting the language of deontic logic with the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. A Neutral Temporal Deontic STIT Logic.Kees van Berkel & Tim Lyon - 2019 - In P. Blackburn, E. Lorini & M. Guo (eds.), Logic, Rationality, and Interaction. Springer. pp. 340-354.
    In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. Notes on a semantic analysis of variable binding term operators.J. Corcoran & John Herring - 1971 - Logique Et Analyse 55:644-657.
    -/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Functional completeness and primitive positive decomposition of relations on finite domains.Sergiy Koshkin - 2024 - Logic Journal of the IGPL 32.
    We give a new and elementary construction of primitive positive decomposition of higher arity relations into binary relations on finite domains. Such decompositions come up in applications to constraint satisfaction problems, clone theory and relational databases. The construction exploits functional completeness of 2-input functions in many-valued logic by interpreting relations as graphs of partially defined multivalued ‘functions’. The ‘functions’ are then composed from ordinary functions in the usual sense. The construction is computationally effective and relies on well-developed methods of functional (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. On graph-theoretic fibring of logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  15. Logic-Language-Ontology.Urszula B. Wybraniec-Skardowska - 2022 - Cham, Switzerland: Springer Nature, Birkhäuser, Studies in Universal Logic series.
    The book is a collection of papers and aims to unify the questions of syntax and semantics of language, which are included in logic, philosophy and ontology of language. The leading motif of the presented selection of works is the differentiation between linguistic tokens (material, concrete objects) and linguistic types (ideal, abstract objects) following two philosophical trends: nominalism (concretism) and Platonizing version of realism. The opening article under the title “The Dual Ontological Nature of Language Signs and the Problem of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. How To Precisify Quantifiers.Arvid Båve - 2011 - Journal of Philosophical Logic 40 (1):103-111.
    I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider claims that vagueness entails precisifications, but holds that precisifications of quantifiers cannot be coherently described: they will either deliver the wrong logical form to quantified sentences, or involve a presupposition that contradicts the claim that the quantifier is vague. Assuming (as does Sider) that the “connectedness” of objects can be precisely defined, I present a counter-example to Sider's contention, consisting of a partial, implicit (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  17. A calculus for Belnap's logic in which each proof consists of two trees.Stefan Wintein & Reinhard Muskens - 2012 - Logique Et Analyse 220:643-656.
    In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  18. Gödel Mathematics Versus Hilbert Mathematics. II Logicism and Hilbert Mathematics, the Identification of Logic and Set Theory, and Gödel’s 'Completeness Paper' (1930).Vasil Penchev - 2023 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 15 (1):1-61.
    The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. A Remark on Probabilistic Measures of Coherence.Sergi Oms - 2020 - Notre Dame Journal of Formal Logic 61 (1):129-140.
    In recent years, some authors have proposed quantitative measures of the coherence of sets of propositions. Such probabilistic measures of coherence (PMCs) are, in general terms, functions that take as their argument a set of propositions (along with some probability distribution) and yield as their value a number that is supposed to represent the degree of coherence of the set. In this paper, I introduce a minimal constraint on PMC theories, the weak stability principle, and show that any correct, coherent, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20.  94
    ONE AND THE MULTIPLE ON THE PHILOSOPHY OF MATHEMATICS - ALEXIS KARPOUZOS.Alexis Karpouzos - 2025 - Comsic Spirit 1:6.
    The relationship between the One and the Multiple in mystic philosophy is a profound and central theme that explores the nature of existence, the cosmos, and the divine. This theme is present in various mystical traditions, including those of the East and West, and it addresses the paradoxical coexistence of the unity and multiplicity of all things. -/- In mystic philosophy, the **One** often represents the ultimate reality, the source from which all things emanate and to which all things return. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  62
    Modal Extension of the Quantified Argument Calculus.Simon D. Vonlanthen - manuscript
    The quantified argument calculus (Quarc) is a novel logic that departs in several ways from mainstream first-order logic. In particular, its quantifiers are not sentential operators attached to variables, but attach to unary predicates to form arguments – quantified arguments – of other predicates. Furthermore, Quarc includes devices to account for anaphora, active-passive-voice distinctions, and sentence- versus predicate-negation. While this base system has already been shown to be sound and complete, modal extensions still lack such results. The present (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22.  58
    In the Beginning was Chiasmus - On the Epistemology of Non-Quantified Modelling: Introduction.Tom Ritchey - manuscript
    Chiastic order is an ancient expression for cross-classification. Cross-classification, in turn, is one of many terms used for the operation of conjoining or cross-mapping one domain, class or set of concepts with another. As such, it is the primordial form of non-quantified modelling and combinatory heuristics. This article presents a brief epistemological history of non-quantified modelling: its prehistory in the form of rhetorical chiasmus; its early (pre-symbolic) use by Plato as a cross-order (paradigmatic) modelling method; and its “modern” (symbolic) use (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. An Epistemic Interpretation of Paraconsistent Weak Kleene Logic.Damian E. Szmuc - forthcoming - Logic and Logical Philosophy:1.
    This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  24. Probabilities on Sentences in an Expressive Logic.Marcus Hutter, John W. Lloyd, Kee Siong Ng & William T. B. Uther - 2013 - Journal of Applied Logic 11 (4):386-420.
    Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of being (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  97
    Against Second-Order Logic: Quine and Beyond.Fraser MacBride - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press. pp. 378-401.
    Is second-order logic logic? Famously Quine argued second-order logic wasn't logic but his arguments have been the subject of influential criticisms. In the early sections of this paper, I develop a deeper perspective upon Quine's philosophy of logic by exploring his positive conception of what logic is for and hence what logic is. Seen from this perspective, I argue that many of the criticisms of his case against second-order logic miss their mark. Then, in the later sections, I go beyond (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Modulated logics and flexible reasoning.Walter Carnielli & Maria Cláudia C. Grácio - 2008 - Logic and Logical Philosophy 17 (3):211-249.
    This paper studies a family of monotonic extensions of first-order logic which we call modulated logics, constructed by extending classical logic through generalized quantifiers called modulated quantifiers. This approach offers a new regard to what we call flexible reasoning. A uniform treatment of modulated logics is given here, obtaining some general results in model theory. Besides reviewing the “Logic of Ultrafilters”, which formalizes inductive assertions of the kind “almost all”, two new monotonic logical systems are proposed here, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. (1 other version)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):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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. Foundational Holism, Substantive Theory of Truth, and A New Philosophy of Logic: Interview with Gila Sher BY Chen Bo.Gila Sher & Chen Bo - 2019 - Philosophical Forum 50 (1):3-57.
    Gila Sher interviewed by Chen Bo: -/- I. Academic Background and Earlier Research: 1. Sher’s early years. 2. Intellectual influence: Kant, Quine, and Tarski. 3. Origin and main Ideas of The Bounds of Logic. 4. Branching quantifiers and IF logic. 5. Preparation for the next step. -/- II. Foundational Holism and a Post-Quinean Model of Knowledge: 1. General characterization of foundational holism. 2. Circularity, infinite regress, and philosophical arguments. 3. Comparing foundational holism and foundherentism. 4. A post-Quinean model of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  29. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  30. Variable Binding Term Operators.John Corcoran, William Hatcher & John Herring - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (12):177-182.
    Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  31.  75
    Theoretical Analysis of DNA Informatics, Bioindicators and Implications of Origins of Life.A. Kamal - manuscript
    The usage of Quantum Similarity through the equation Z = {∀Θ∈Z→∃s ∈ S ʌ ∃t ∈ T: Θ= (s,t)}., represents a way to analyze the way communication works in our DNA. Being able to create the object set reference for z being (s,t) in our DNA strands, we are able to set logical tags and representations of our DNA in a completely computational form. This will allow us to have a better understanding of the sequences that happen in our (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. The Logicality of Language: A new take on Triviality, “Ungrammaticality”, and Logical Form.Guillermo Del Pinal - 2017 - Noûs 53 (4):785-818.
    Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  33. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  34.  44
    Sobre una teoría ‘pura’ de casi-conjuntos y su aplicación a una ontología cuántica de propiedades.Décio Krause & Juan Pablo Jorge - manuscript
    In this paper, we introduce a quasi-set theory without atoms. The quasi-sets (qsets) can have as elements completely indiscernible things which do not turn out to be the very same thing as it would be implied if its underlying logic was classical logic. A quasi-set can have a cardinal, called its quasi-cardinal, but this is made so that, at least for the finite case, the quasi-cardinal is not an ordinal, and hence the indistinguishable elements of a quasi-set cannot be ordered. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Supposition and desire in a non-classical setting.J. Robert G. Williams - unknown
    *These notes were folded into the published paper "Probability and nonclassical logic*. Revising semantics and logic has consequences for the theory of mind. Standard formal treatments of rational belief and desire make classical assumptions. If we are to challenge the presuppositions, we indicate what is kind of theory is going to take their place. Consider probability theory interpreted as an account of ideal partial belief. But if some propositions are neither true nor false, or are half true, or whatever—then it’s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. A General Semantics for Logics of Affirmation and Negation.Fabien Schang - 2021 - Journal of Applied Logics - IfCoLoG Journal of Logics and Their Applications 8 (2):593-609.
    A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. A Description Logic of Typicality for Conceptual Combination.Antonio Lieto & Gian Luca Pozzato - 2018 - In Antonio Lieto & Gian Luca Pozzato (eds.), 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  38. The Logical Form of Status-Function Declarations.Richard Evans - 2009 - Etica E Politica 11 (1):203-259.
    We are able to participate in countless different sorts of social practice. This indefinite set of capacities must be explainable in terms of a finite stock of capacities. This paper compares and contrasts two different explanations. A standard decomposition of the capacity to participate in social practices goes something like this: the interpreter arrives on the scene with a stock of generic practice-types. He looks at the current scene to fill-in the current tokens of these types. He looks at the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Completeness of a Hypersequent Calculus for Some First-order Gödel Logics with Delta.Matthias Baaz, Norbert Preining & Richard Zach - 2006 - In Baaz Matthias, Preining Norbert & Zach Richard (eds.), 36th Interna- tional Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings. 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.
    Download  
     
    Export citation  
     
    Bookmark  
  40. A Fortiori Logic: Innovations, History and Assessments.Avi Sion - 2013 - Geneva, Switzerland: CreateSpace & Kindle; Lulu..
    A Fortiori Logic: Innovations, History and Assessments is a wide-ranging and in-depth study of a fortiori reasoning, comprising a great many new theoretical insights into such argument, a history of its use and discussion from antiquity to the present day, and critical analyses of the main attempts at its elucidation. Its purpose is nothing less than to lay the foundations for a new branch of logic and greatly develop it; and thus to once and for all dispel the many fallacious (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  42. Internal Set Theory IST# Based on Hyper Infinitary Logic with Restricted Modus Ponens Rule: Nonconservative Extension of the Model Theoretical NSA.Jaykov Foukzon - 2022 - Journal of Advances in Mathematics and Computer Science 37 (7): 16-43.
    The incompleteness of set theory ZF C leads one to look for natural nonconservative extensions of ZF C in which one can prove statements independent of ZF C which appear to be “true”. One approach has been to add large cardinal axioms.Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski-Grothendieck set theory T G or It is a nonconservative extension of ZF C and is obtained from other axiomatic set theories by the inclusion of Tarski’s axiom (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Electrophysiological connectivity of logical deduction: Early cortical MEG study.Anton Toro Luis F., Salto Francisco, Requena Carmen & Maestu Fernando - 2023 - Cortex 166:365-376.
    Complex human reasoning involves minimal abilities to extract conclusions implied in the available information. These abilities are considered “deductive” because they exemplify certain abstract relations among propositions or probabilities called deductive arguments. However, the electrophysiological dynamics which supports such complex cognitive pro- cesses has not been addressed yet. In this work we consider typically deductive logico- probabilistically valid inferences and aim to verify or refute their electrophysiological functional connectivity differences from invalid inferences with the same content (same relational variables, same (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. A quantitative-informational approach to logical consequence.Marcos Antonio Alves & Ítala M. Loffredo D'Otaviano - 2015 - In Beziau Jean-Yves (ed.), The Road to Universal Logic (Studies in Universal Logic). Springer International Publishing. pp. 105-24.
    In this work, we propose a definition of logical consequence based on the relation between the quantity of information present in a particular set of formulae and a particular formula. As a starting point, we use Shannon‟s quantitative notion of information, founded on the concepts of logarithmic function and probability value. We first consider some of the basic elements of an axiomatic probability theory, and then construct a probabilistic semantics for languages of classical propositional logic. We define the quantity (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45.  68
    Tractable depth-bounded approximations to FDE and its satellites.A. Solares-Rojas & Marcello D'Agostino - 2023 - Journal of Logic and Computation 34 (5):815-855.
    FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Cień Boga w ogrodzie filozofa. Parc de La Villette w Paryżu w kontekście filozofii chôry.Wąs Cezary - 2021 - Wrocław: Wydawnictwo Uniwersytetu Wrocławskiego.
    The Shadow of God in the Philosopher’s Garden. The Parc de La Villette in Paris in the context of the philosophy of chôra I Bernard Tschumi’s project of the Parc de La Villette could have won the competition and was implemented thanks to the political atmosphere that accompanied the victory of the left-wing candidate in the French presidential elections in 1981. François Mitterand’s revision of the political programme and the replacement of radical reforms with the construction of prestigious architectural objects (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47. A graph-theoretic account of logics.A. Sernadas, C. Sernadas, J. Rasga & Marcelo E. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1281-1320.
    A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. 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.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  49. complete enumerative inductions.John Corcoran - 2006 - Bulletin of Symbolic Logic 12:465-6.
    Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. -/- Matthew, Mark, Luke, and John wrote Greek. ? Every evangelist wrote Greek. -/- Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John. ? Every evangelist wrote Greek. -/- The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Follow the Math!: The Mathematics of Quantum Mechanics as the Mathematics of Set Partitions Linearized to (Hilbert) Vector Spaces.David Ellerman - 2022 - Foundations of Physics 52 (5):1-40.
    The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 953