About this topic
Summary

The relationship between logic and information is an intimate one that goes both ways. Firstly, information has played a role in providing a basis for certain accounts of logic. At a basic level there is the interpretation that good logic arguments are just those arguments where the information in the conclusion is already contained in the premises of that argument. Furthermore, notions of information have been used to good effect in developing semantics for certain logics, particularly relevant logic. Secondly, logics of information have provided formal accounts of various information phenomena, such as logics of being informed.

Key works Jakko Hintikka has been one of the pioneers in investigating the relationship between logic and information, looking at measures of semantic information for contingent propositions and information measures for tautologies/deductive inferences. His Hintikka 1970 contains papers on the topic. Devlin 1991, Barwise & Seligman 1997 and Israel & Perry 1991 represent an important collection of works that provide general accounts of information flow based on situation semantics/theory. Mares 1996 and Restall 1996 are attempts to provide an informational semantics for relevant logic.
Related

Contents
232 found
Order:
1 — 50 / 232
  1. 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   Direct download  
     
    Export citation  
     
    Bookmark  
  2. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and loss (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. Phrenological Argument: God's Mental State of Inadequacy (Parapraxis).Joey Lawsin - manuscript
    The Phrenological Argument, also known as God's Parapraxis, is a new provocative philosophical argument that showcases God's Mental State of Inadequacy in his creation of the Human Mind. Lawsin* argues that if God has a perfect mind flawlessly capable of knowing things in advance, then he should have anticipated ahead of time the repercussions of creating a human mind that cannot fathom Truth and Reality. But since he created a mind incapable of knowing what is real and what is true, (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  4. Valuations.Jean-Louis Lenard - manuscript
    Is logic empirical? Is logic to be found in the world? Or is logic rather a convention, a product of conventions, part of the many rules that regulate the language game? Answers fall in either camp. We like the linguistic answer. In this paper, we want to analyze how a linguistic community would tackle the problem of developing a logic and show how the linguistic conventions adopted by the community determine the properties of the local logic. Then show how to (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  5. A Semantic Information Formula Compatible with Shannon and Popper's Theories.Chenguang Lu - manuscript
    Semantic Information conveyed by daily language has been researched for many years; yet, we still need a practical formula to measure information of a simple sentence or prediction, such as “There will be heavy rain tomorrow”. For practical purpose, this paper introduces a new formula, Semantic Information Formula (SIF), which is based on L. A. Zadeh’s fuzzy set theory and P. Z. Wang’s random set falling shadow theory. It carries forward C. E. Shannon and K. Popper’s thought. The fuzzy set’s (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Lying in the Time of Crisis.Venkata Rayudu Posina - manuscript
    Beginning with an examination of the recent Nature News centered on Harvard-Lancet-Mehra et al. COVID-19 research scandal, I put forth suggestions--for further debate--to safeguard the integrity of science in a time of crisis. In particular, I identify a subtle form of lying published as Nature news. Subsequently, drawing on Scarry's book "Thinking in an Emergency", I argue that slow reasoning and quick action (called for by crises) are not mutually incompatible; thinking can be transformed into conscious-reflex action by way of (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  7. (1 other version)An Occurrence Description Logic.Farshad Badie & Hans Götzsche - forthcoming - Logical Investigations:142-156.
    Description Logics (DLs) are a family of well-known terminological knowledge representation formalisms in modern semantics-based systems. This research focuses on analysing how our developed Occurrence Logic (OccL) can conceptually and logically support the development of a description logic. OccL is integrated into the alternative theory of natural language syntax in `Deviational Syntactic Structures' under the label `EFA(X)3' (or the third version of Epi-Formal Analysis in Syntax, EFA(X), which is a radical linguistic theory). From the logical point of view, OccL is (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  8. Rational dynamics in efficient inquiry.David Barack - forthcoming - Analysis.
    Which premisses should we use to start our inquiries? Which transitions during inquiry should we take next? When should we switch lines of inquiry? In this paper, I address these open questions about inquiry, formulating novel norms for such decisions during deductive reasoning. I use the first-order predicate calculus, in combination with Carnap’s state description framework, to state such norms. Using that framework, I first demonstrate some properties of sets of sentences used in deduction. I then state some norms for (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. Two-method errors: having it both ways.John Corcoran & Idris Samawi Hamid - forthcoming - Bulletin of Symbolic Logic.
    ►JOHN CORCORAN AND IDRIS SAMAWI HAMID, Two-method errors: having it both ways. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: [email protected] Philosophy, Colorado State University, Fort Collins, CO 80523-1781 USA E-mail: [email protected] Where two methods produce similar results, mixing the two sometimes creates errors we call two-method errors, TMEs: in style, syntax, semantics, pragmatics, implicature, logic, or action. This lecture analyzes examples found in technical and in non-technical contexts. One can say “Abe knows whether Ben draws” in two other (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  10. An informational view of classical logic.Marcello D'Agostino - forthcoming - Theoretical Computer Science.
    We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by any finitely-valued matrix, it (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  11. Variations on determinacy and.Ramez L. Sami - forthcoming - Journal of Symbolic Logic:1-10.
  12. Logic, Language & Information: The Makings of a New Science?Johan van Benthem - forthcoming - Journal of Logic, Language, and Information.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  13. Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  14. A New Logic, a New Information Measure, and a New Information-Based Approach to Interpreting Quantum Mechanics.David Ellerman - 2024 - Entropy Special Issue: Information-Theoretic Concepts in Physics 26 (2).
    The new logic of partitions is dual to the usual Boolean logic of subsets (usually presented only in the special case of the logic of propositions) in the sense that partitions and subsets are category-theoretic duals. The new information measure of logical entropy is the normalized quantitative version of partitions. The new approach to interpreting quantum mechanics (QM) is showing that the mathematics (not the physics) of QM is the linearized Hilbert space version of the mathematics of partitions. Or, putting (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15. Rozwiązanie paradoksów Rossa i Priora. Klasyczny Rachunek Modalności..Jan Pociej - 2024 - Https://Doi.Org/10.6084/M9.Figshare.25196138.V1.
    Rozwiązanie paradoksów Rossa i Priora okazało się trudnym zadaniem. Jego pierwsze dwa etapy, obejmujące identyfikację prawdziwych natur implikacji i wartości logicznych, zostały opisane w artykułach "Rozwiązanie paradoksu implikacji materialnej – 2024" i "Rozwiązanie dylematu Jörgensena – 2024". Ten artykuł opisuje trzeci etap, obejmujący odkrycie brakujących funktorów modalnych i Klasycznego Rachunku Modalności. Na zakończenie zostają podane procedury rozwiązania obu paradoksów.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  16. A Formal Model of Primitive Aspects of Cognition and Learning in Cell Biology as a Generalizable Case Study of Peircean Logic.Timothy M. Rogers - 2024 - Sign Systems Studies 52 (1-2):8-48.
    A formal model of the processes of digestion in a hypothetical cell is developed and discussed as a case study of how the threefold logic of Peircean semiotics works within Rosen’s paradigm of relational ontology. The formal model is used to demonstrate several fundamental differences between a relational description of biological processes and a mechanistic description. The formal model produces a logic of embodied generalization that is mediated and determined by the cell through its interactions with the environment. Specifically, the (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  17. Logical reduction of relations: From relational databases to Peirce’s reduction thesis.Sergiy Koshkin - 2023 - Logic Journal of the IGPL 31 (5):779-809.
    We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18. 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 generalized (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. Computational logic. Vol. 1: Classical deductive computing with classical logic. 2nd ed.Luis M. Augusto - 2022 - London: College Publications.
    This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical first-order predicate calculus with (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20. Relationships between computability-theoretic properties of problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.
    A problem is a multivalued function from a set of instances to a set of solutions. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness property if every computable instance of the problem admits a solution relative to which the property holds. For example, cone avoidance is the ability, given a noncomputable set A and a computable instance of a problem ${\mathsf {P}}$, to find a solution relative to which A (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21. A Multi-wavelength Data Analysis with Multi-mission Space Telescopes.Yang I. Pachankis - 2022 - International Journal of Innovative Science and Research Technology 7 (1):701-708.
    The article summarizes the software tool on astrophysical analysis with multi-wavelength space telescope data. It recaps the evidence analysis conducted on the Kerr-Newman black hole (KNBH). It was written prior to the article Research on the Kerr-Newman Black Hole in M82 Confirms Black Hole and White Hole Juxtapose not soon after the experiment. The conducted analysis suggested Hawking radiation is caused by the movement of ergosurfaces of the BH and serves as the primal evidence for black hole and white hole (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  22. MASS SURVEILLANCE, BEHAVIOURAL CONTROL, AND PSYCHOLOGICAL COERCION THE MORAL ETHICAL RISKS IN COMMERCIAL DEVICES.Yang Immanuel Pachankis - 2022 - In David C. Wyld & Dhinaharan Nagamalai (eds.), Computer Science and Information Technology. pp. 151-168.
    The research observed, in parallel and comparatively, a surveillance state’s use of communication & cyber networks with satellite applications for power political & realpolitik purposes, in contrast to the outer space security & legit scientific purpose driven cybernetics. The research adopted a psychoanalytic & psychosocial method of observation in the organizational behaviors of the surveillance state, and a theoretical physics, astrochemical, & cosmological feedback method in the contrast group of cybernetics. Military sociology and multilateral movements were adopted in the diagnostic (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  23. Some Concepts of Space, Time, and Lengths in Simplified Chinese*: An Analytical Linguistics Approach.Yang Immanuel Pachankis - 2022 - International Journal of Innovative Science and Research Technology 7 (6):550-562.
    The article explains on the two-year experiment after the author’s finalization of dissertation. The thesis of the dissertation was hidden in the last chapter with analytical linguistics. It was done so with the fascist development of the Chinese Communist regime with neo- Nazi characteristics. Since numerous prior warnings on the political downshifts & coup d’état in China was willfully ignored by the university, the linguistic innovations in dissertation found a balance between multilateralism and outer space (security). The experiments were conducted (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24. Towards Tractable Approximations to Many-Valued Logics: the Case of First Degree Entailment.Alejandro Solares-Rojas & Marcello D’Agostino - 2022 - In Igor Sedlár (ed.), The Logica Yearbook 2021. College Publications. pp. 57-76.
    FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25. The Information Economy.Ilexa Yardley - 2022 - Https://Medium.Com/the-Circular-Theory.
    Everything in a human 'universe' (a human mind) depends upon finance. This is because finance is the tokenization, and, therefore, the conservation (the representation) of an uber-basic circle. One zero and (or) one one produces an unlimited number (variation) (combination) of zeroes and ones. Which is exactly what is happening in all disciplines (philosophy, physics, psychology, biology, technology, media).
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  26. Information, meaning and physics: The intellectual evolution of the English School of Information Theory during 1946-1956.Javier Anta - 2021 - Science in Context 34 (3):357-373.
    ArgumentIn this comparative historical analysis, we will analyze the intellectual tendency that emerged between 1946 and 1956 to take advantage of the popularity of communication theory to develop a kind of informational epistemology of statistical mechanics. We will argue that this tendency results from a historical confluence in the early 1950s of certain theoretical claims of the so-called English School of Information Theory, championed by authors such as Gabor (1956) or MacKay (1969), and from the attempt to extend the profound (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. Diagrammatic Representation and Inference. 12th International Conference, Diagrams 2021, Virtual, September 28–30, 2021, Proceedings.Amrita Basu, Gem Stapleton, Sven Linker, Catherine Legg, Emmanuel Manalo & Petrucio Viana (eds.) - 2021 - Springer.
    This book constitutes the refereed proceedings of the 12th International Conference on the Theory and Application of Diagrams, Diagrams 2021, held virtually in September 2021. The 16 full papers and 25 short papers presented together with 16 posters were carefully reviewed and selected from 94 submissions. The papers are organized in the following topical sections: design of concrete diagrams; theory of diagrams; diagrams and mathematics; diagrams and logic; new representation systems; analysis of diagrams; diagrams and computation; cognitive analysis; diagrams as (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  28. Intuitionistic fixed point logic.Ulrich Berger & Hideki Tsuiki - 2021 - Annals of Pure and Applied Logic 172 (3):102903.
    We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction free formulas. The interpretation is shown to be sound with respect to a domain-theoretic denotational semantics and a corresponding lazy operational semantics of a functional language for extracted programs. We also show how (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. Completion of choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.
    We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal rôle in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice. On the other hand, choice problems also characterize several natural classes of computable problems, such as finite mind change computable problems, non-deterministically computable problems, Las Vegas computable problems and effectively Borel measurable functions. The closure operator of completion generates the concept of total (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  30. Techno-Telepathy & Silent Subvocal Speech-Recognition Robotics.Virgil W. Brower - 2021 - HORIZON. Studies in Phenomenology 10 (1):232-257.
    The primary focus of this project is the silent and subvocal speech-recognition interface unveiled in 2018 as an ambulatory device wearable on the neck that detects a myoelectrical signature by electrodes worn on the surface of the face, throat, and neck. These emerge from an alleged “intending to speak” by the wearer silently-saying-something-to-oneself. This inner voice is believed to occur while one reads in silence or mentally talks to oneself. The artifice does not require spoken sounds, opening the mouth, or (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. Recursive axiomatisations from separation properties.Rob Egrot - 2021 - Journal of Symbolic Logic 86 (3):1228-1258.
    We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property, We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation subclasses whose axiomatisations are recursively enumerable in our second-order fragment can also be recursively axiomatised in their original first-order language. We pin down the expressive power of this formalism with respect to first-order logic, and investigate some questions relating to decidability and computational complexity. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32. Computable irrational numbers with representations of surprising complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.
  33. Knowability Relative to Information.Peter Hawke & Franz Berto - 2021 - Mind 130 (517):1-33.
    We present a formal semantics for epistemic logic, capturing the notion of knowability relative to information (KRI). Like Dretske, we move from the platitude that what an agent can know depends on her (empirical) information. We treat operators of the form K_AB (‘B is knowable on the basis of information A’) as variably strict quantifiers over worlds with a topic- or aboutness- preservation constraint. Variable strictness models the non-monotonicity of knowledge acquisition while allowing knowledge to be intrinsically stable. Aboutness-preservation models (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  34. Probabilities with Gaps and Gluts.Dominik Klein, Ondrej Majer & Soroush Rafiee Rad - 2021 - Journal of Philosophical Logic 50 (5):1107-1141.
    Belnap-Dunn logic, sometimes also known as First Degree Entailment, is a four-valued propositional logic that complements the classical truth values of True and False with two non-classical truth values Neither and Both. The latter two are to account for the possibility of the available information being incomplete or providing contradictory evidence. In this paper, we present a probabilistic extension of BD that permits agents to have probabilistic beliefs about the truth and falsity of a proposition. We provide a sound and (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Information and the History of Philosophy.Chris Meyns (ed.) - 2021 - Routledge.
    In recent years the philosophy of information has emerged as an important area of research in philosophy. However, until now information’s philosophical history has been largely overlooked. Information and the History of Philosophy is the first comprehensive investigation of the history of philosophical questions around information, including work from before the Common Era to the twenty-first century. It covers scientific and technology-centred notions of information; views of human information processing, as well as socio-political topics such as the control and use (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Intrinsic smallness.Justin Miller - 2021 - Journal of Symbolic Logic 86 (2):558-576.
    Recent work in computability theory has focused on various notions of asymptotic computability, which capture the idea of a set being “almost computable.” One potentially upsetting result is that all four notions of asymptotic computability admit “almost computable” sets in every Turing degree via coding tricks, contradicting the notion that “almost computable” sets should be computationally close to the computable sets. In response, Astor introduced the notion of intrinsic density: a set has defined intrinsic density if its image under any (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. A New Argument for Kolomogorov Conditionalization.Michael Nielsen - 2021 - Review of Symbolic Logic 14 (4):1-16.
    This paper contributes to a recent research program that extends arguments supporting elementary conditionalization to arguments supporting conditionalization with general, measure-theoretic conditional probabilities. I begin by suggesting an amendment to the framework that Rescorla (2018) has used to characterize regular conditional probabilities in terms of avoiding Dutch book. If we wish to model learning scenarios in which an agent gains complete membership knowledge about some subcollection of the events of interest to her, then we should focus on updating policies that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. The reverse mathematics of theorems of Jordan and lebesgue.André Nies, Marcus A. Triplett & Keita Yokoyama - 2021 - Journal of Symbolic Logic 86 (4):1657-1675.
    The Jordan decomposition theorem states that every function $f \colon \, [0,1] \to \mathbb {R}$ of bounded variation can be written as the difference of two non-decreasing functions. Combining this fact with a result of Lebesgue, every function of bounded variation is differentiable almost everywhere in the sense of Lebesgue measure. We analyze the strength of these theorems in the setting of reverse mathematics. Over $\mathsf {RCA}_{0}$, a stronger version of Jordan’s result where all functions are continuous is equivalent to (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39. Computable analogs of cardinal characteristics: Prediction and rearrangement.Iván Ongay-Valverde & Paul Tveite - 2021 - Annals of Pure and Applied Logic 172 (1):102872.
    There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles. Each property yields a highness notion in the Turing degrees. In this paper we study the highness notions that result from the translation of the evasion number and its dual, the prediction number, as well as two versions of the rearrangement number. When translated appropriately, these yield four new highness (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if the content (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  41. Finding the limit of incompleteness I.Yong Cheng - 2020 - Bulletin of Symbolic Logic 26 (3-4):268-286.
    In this paper, we examine the limit of applicability of Gödel’s first incompleteness theorem. We first define the notion “$\textsf {G1}$ holds for the theory $T$”. This paper is motivated by the following question: can we find a theory with a minimal degree of interpretation for which $\textsf {G1}$ holds. To approach this question, we first examine the following question: is there a theory T such that Robinson’s $\mathbf {R}$ interprets T but T does not interpret $\mathbf {R}$ and $\textsf (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42. Computable linear orders and products.Andrey N. Frolov, Steffen Lempp, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (2):605-623.
    We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$, $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. Measuring Inconsistency in Generalized Propositional Logic.John Grant - 2020 - Logica Universalis 14 (3):331-356.
    Consistency is one of the key concepts of logic; logicians have put a great deal of effort into proving the consistency of many logics. Understanding what causes inconsistency is also important; some logicians have developed paraconsistent logics that, unlike classical logics, allow some contradictions without making all formulas provable. Another direction of research studies inconsistency by measuring the amount of inconsistency of sets of formulas. While the initial attempt in 1978 was too ambitious in trying to do this for first-order (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Extended Syllogistics in Calculus CL.Jens Lemanski - 2020 - Journal of Applied Logics 8 (2):557-577.
    Extensions of traditional syllogistics have been increasingly researched in philosophy, linguistics, and areas such as artificial intelligence and computer science in recent decades. This is mainly due to the fact that syllogistics is seen as a logic that comes very close to natural language abilities. Various forms of extended syllogistics have become established. This paper deals with the question to what extent a syllogistic representation in CL diagrams can be seen as a form of extended syllogistics. It will be shown (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  45. High-Order Metaphysics as High-Order Abstractions and Choice in Set Theory.Vasil Penchev - 2020 - Epistemology eJournal (Elsevier: SSRN) 13 (21):1-3.
    The link between the high-order metaphysics and abstractions, on the one hand, and choice in the foundation of set theory, on the other hand, can distinguish unambiguously the “good” principles of abstraction from the “bad” ones and thus resolve the “bad company problem” as to set theory. Thus it implies correspondingly a more precise definition of the relation between the axiom of choice and “all company” of axioms in set theory concerning directly or indirectly abstraction: the principle of abstraction, axiom (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46. Semantic Information G Theory and Logical Bayesian Inference for Machine Learning.Chenguang Lu - 2019 - Information 10 (8):261.
    An important problem with machine learning is that when label number n>2, it is very difficult to construct and optimize a group of learning functions, and we wish that optimized learning functions are still useful when prior distribution P(x) (where x is an instance) is changed. To resolve this problem, the semantic information G theory, Logical Bayesian Inference (LBI), and a group of Channel Matching (CM) algorithms together form a systematic solution. MultilabelMultilabel A semantic channel in the G theory consists (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Effective Validity: A Generalized Logic for Stable Approximate Inference.Robert H. C. Moir - 2019 - In Nicolas Fillion, Robert M. Corless & Ilias S. Kotsireas (eds.), Algorithms and Complexity in Mathematics, Epistemology, and Science: Proceedings of 2015 and 2016 Acmes Conferences. Springer New York. pp. 225-268.
    The traditional approach in philosophy of using logic to reconstruct scientific theories and methods operates by presenting or representing a scientific theory or method in a specialized formal language. The logic of such languages is deductive, which makes this approach effective for those aspects of science that use deductive methods or for which deductive inference provides a good idealization. Many theories and methods in science, however, use non-deductive forms of approximation. Approximate inferences, which produce approximately correct conclusions and do so (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. A Toothful of Concepts: Towards a Theory of Weighted Concept Combination.Daniele Porello, Oliver Kutz, Guendalina Righetti, Nicolas Troquard, Pietro Galliani & Claudio Masolo - 2019 - In Mantas Simkus & Grant E. Weddell (eds.), Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, June 18-21, 2019.
    We introduce a family of operators to combine Description Logic concepts. They aim to characterise complex concepts that apply to instances that satisfy \enough" of the concept descriptions given. For instance, an individual might not have any tusks, but still be considered an elephant. To formalise the meaning of "enough", the operators take a list of weighted concepts as arguments, and a certain threshold to be met. We commence a study of the formal properties of these operators, and study some (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. SNOMED CT standard ontology based on the ontology for general medical science.Shaker El-Sappagh, Francesco Franda, Ali Farman & Kyung-Sup Kwak - 2018 - BMC Medical Informatics and Decision Making 76 (18):1-19.
    Background: Systematized Nomenclature of Medicine—Clinical Terms (SNOMED CT, hereafter abbreviated SCT) is acomprehensive medical terminology used for standardizing the storage, retrieval, and exchange of electronic healthdata. Some efforts have been made to capture the contents of SCT as Web Ontology Language (OWL), but theseefforts have been hampered by the size and complexity of SCT. Method: Our proposal here is to develop an upper-level ontology and to use it as the basis for defining the termsin SCT in a way that will (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Logical Entropy: Introduction to Classical and Quantum Logical Information theory.David Ellerman - 2018 - Entropy 20 (9):679.
    Logical information theory is the quantitative version of the logic of partitions just as logical probability theory is the quantitative version of the dual Boolean logic of subsets. The resulting notion of information is about distinctions, differences and distinguishability and is formalized using the distinctions of a partition. All the definitions of simple, joint, conditional and mutual entropy of Shannon information theory are derived by a uniform transformation from the corresponding definitions at the logical level. The purpose of this paper (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 232