Results for 'cut-elimination, Hilbert arithmetic, metaphor, proposition, propositional logic, quantum measurement'

944 found
Order:
  1. Gentzen’s “cut rule” and quantum measurement in terms of Hilbert arithmetic. Metaphor and understanding modeled formally.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal 14 (14):1-37.
    Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Hilbert mathematics versus (or rather “without”) Gödel mathematics: V. Ontomathematics!Vasil Penchev - 2024 - Metaphysics eJournal (Elsevier: SSRN) 17 (10):1-57.
    The paper is the final, fifth part of a series of studies introducing the new conceptions of “Hilbert mathematics” and “ontomathematics”. The specific subject of the present investigation is the proper philosophical sense of both, including philosophy of mathematics and philosophy of physics not less than the traditional “first philosophy” (as far as ontomathematics is a conservative generalization of ontology as well as of Heidegger’s “fundamental ontology” though in a sense) and history of philosophy (deepening Heidegger’s destruction of it (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. What the Tortoise Said to Achilles: Lewis Carroll’s paradox in terms of Hilbert arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (22):1-32.
    Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. 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 for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. 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. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Hilbert Mathematics Versus Gödel Mathematics. IV. The New Approach of Hilbert Mathematics Easily Resolving the Most Difficult Problems of Gödel Mathematics.Vasil Penchev - 2023 - Philosophy of Science eJournal (Elsevier: SSRN) 16 (75):1-52.
    The paper continues the consideration of Hilbert mathematics to mathematics itself as an additional “dimension” allowing for the most difficult and fundamental problems to be attacked in a new general and universal way shareable between all of them. That dimension consists in the parameter of the “distance between finiteness and infinity”, particularly able to interpret standard mathematics as a particular case, the basis of which are arithmetic, set theory and propositional logic: that is as a special “flat” case (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. Logic, mathematics, physics: from a loose thread to the close link: Or what gravity is for both logic and mathematics rather than only for physics.Vasil Penchev - 2023 - Astrophysics, Cosmology and Gravitation Ejournal 2 (52):1-82.
    Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Fermat’s last theorem proved in Hilbert arithmetic. III. The quantum-information unification of Fermat’s last theorem and Gleason’s theorem.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (12):1-30.
    The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9.  47
    Tractable depth-bounded approximations to some propositional logics. Towards more realistic models of logical agents.A. Solares-Rojas - 2022 - Dissertation, University of Milan
    The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. “Two bits less” after quantum-information conservation and their interpretation as “distinguishability / indistinguishability” and “classical / quantum”.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (46):1-7.
    The paper investigates the understanding of quantum indistinguishability after quantum information in comparison with the “classical” quantum mechanics based on the separable complex Hilbert space. The two oppositions, correspondingly “distinguishability / indistinguishability” and “classical / quantum”, available implicitly in the concept of quantum indistinguishability can be interpreted as two “missing” bits of classical information, which are to be added after teleportation of quantum information to be restored the initial state unambiguously. That new understanding (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. The Completeness: From Henkin's Proposition to Quantum Computer.Vasil Penchev - 2018 - Логико-Философские Штудии 16 (1-2):134-135.
    The paper addresses Leon Hen.kin's proposition as a " lighthouse", which can elucidate a vast territory of knowledge uniformly: logic, set theory, information theory, and quantum mechanics: Two strategies to infinity are equally relevant for it is as universal and t hus complete as open and thus incomplete. Henkin's, Godel's, Robert Jeroslow's, and Hartley Rogers' proposition are reformulated so that both completeness and incompleteness to be unified and thus reduced as a joint property of infinity and of all infinite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. Cut elimination for systems of transparent truth with restricted initial sequents.Carlo Nicolai - manuscript
    The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Fermat’s last theorem proved in Hilbert arithmetic. II. Its proof in Hilbert arithmetic by the Kochen-Specker theorem with or without induction.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (10):1-52.
    The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. Gödel mathematics versus Hilbert mathematics. I. The Gödel incompleteness (1931) statement: axiom or theorem?Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (9):1-56.
    The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  18. Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  19. Completeness before Post: Bernays, Hilbert, and the development of propositional logic.Richard Zach - 1999 - Bulletin of Symbolic Logic 5 (3):331-366.
    Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  20. Hilbert arithmetic as a Pythagorean arithmetic: arithmetic as transcendental.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (54):1-24.
    The paper considers a generalization of Peano arithmetic, Hilbert arithmetic as the basis of the world in a Pythagorean manner. Hilbert arithmetic unifies the foundations of mathematics (Peano arithmetic and set theory), foundations of physics (quantum mechanics and information), and philosophical transcendentalism (Husserl’s phenomenology) into a formal theory and mathematical structure literally following Husserl’s tracе of “philosophy as a rigorous science”. In the pathway to that objective, Hilbert arithmetic identifies by itself information related to finite sets (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Verified completeness in Henkin-style for intuitionistic propositional logic.Huayu Guo, Dongheng Chen & Bruno Bentzen - 2023 - In Bruno Bentzen, Beishui Liao, Davide Liga, Reka Markovich, Bin Wei, Minghui Xiong & Tianwen Xu (eds.), Logics for AI and Law: Joint Proceedings of the Third International Workshop on Logics for New-Generation Artificial Intelligence and the International Workshop on Logic, AI and Law, September 8-9 and 11-12, 2023, Hangzhou. College Publications. pp. 36-48.
    This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Fermat’s last theorem proved in Hilbert arithmetic. I. From the proof by induction to the viewpoint of Hilbert arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (7):1-57.
    In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. How to prove the consistency of arithmetic.Jaakko Hintikka & Besim Karakadilar - 2006 - Acta Philosophica Fennica 78:1.
    It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also be proved (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  24. Hypersequents and the proof theory of intuitionistic fuzzy logic.Matthias Baaz & Richard Zach - 2000 - In Clote Peter G. & Schwichtenberg Helmut (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. 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, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  25. The enduring scandal of deduction: is propositional logic really uninformative?Marcello D'Agostino & Luciano Floridi - 2009 - Synthese 167 (2):271-315.
    Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  26. Quantum mechanics as a deterministic theory of a continuum of worlds.Kim Joris Boström - 2015 - Quantum Studies: Mathematics and Foundations 2 (3):315-347.
    A non-relativistic quantum mechanical theory is proposed that describes the universe as a continuum of worlds whose mutual interference gives rise to quantum phenomena. A logical framework is introduced to properly deal with propositions about objects in a multiplicity of worlds. In this logical framework, the continuum of worlds is treated in analogy to the continuum of time points; both “time” and “world” are considered as mutually independent modes of existence. The theory combines elements of Bohmian mechanics and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  27. Metaphor, Relevance Theory, and the Curious Nature of Cut-Off Points. A Philosophical Attempt to Understand the Tension Caused by Non-Propositional Effects.Pascal Lemmer - 2022 - Philosophy Kitchen 17 (Metaphor):109-121.
    How to account for metaphor has long been a contentious issue within pragmatics. Revisiting this debate, Wilson & Carston (2019) analyse Grice’s oft-discussed exclusion of metaphor as an empirically unjustified use of cut-off points on the empirical continuum of language and link it a tension between his underlying focus on formalisation contrary to their aim of maximising pragmatics’ empirical scope. In spite of the latter, Relevance Theory’s various own models fail to account for essential characteristics of metaphor caused by certain (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. The Basics of Display Calculi.Tim Lyon, Christian Ittner, Timo Eckhardt & Norbert Gratzl - 2017 - Kriterion - Journal of Philosophy 31 (2):55-100.
    The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.
    Download  
     
    Export citation  
     
    Bookmark  
  29. On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics.Tim Lyon - 2021 - Journal of Logic and Computation 31 (1):213-265.
    This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, such (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  30. Choice, Infinity, and Negation: Both Set-Theory and Quantum-Information Viewpoints to Negation.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal 12 (14):1-3.
    The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. The new paradigm: quantum interbeing.Brian Wachter - manuscript
    It is the conclusion advanced in this paper that there is a necessary and sufficient causal relationship between theory of mind and the neurological creation of conscious and unconscious quantum logic existing in superposition in the human brain. It takes two intelligent agents to make one self-aware agent. -/- A key element of my reasoning is the instantiation of superposition by way of a logical device I call the “state-system.” The newly conscious human remains unaware of the inner transformation (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Voronkov Andrei & Parigot Michel (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. 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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. Modal logic with non-deterministic semantics: Part I—Propositional case.Marcelo E. Coniglio, Luis Fariñas del Cerro & Newton Peron - 2020 - Logic Journal of the IGPL 28 (3):281-315.
    Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. Quantum phenomenology as a “rigorous science”: the triad of epoché and the symmetries of information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (48):1-18.
    Husserl (a mathematician by education) remained a few famous and notable philosophical “slogans” along with his innovative doctrine of phenomenology directed to transcend “reality” in a more general essence underlying both “body” and “mind” (after Descartes) and called sometimes “ontology” (terminologically following his notorious assistant Heidegger). Then, Husserl’s tradition can be tracked as an idea for philosophy to be reinterpreted in a way to be both generalized and mathenatizable in the final analysis. The paper offers a pattern borrowed from the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. The 'Noncausal Causality' of Quantum Information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (45):1-7.
    The paper is concentrated on the special changes of the conception of causality from quantum mechanics to quantum information meaning as a background the revolution implemented by the former to classical physics and science after Max Born’s probabilistic reinterpretation of wave function. Those changes can be enumerated so: (1) quantum information describes the general case of the relation of two wave functions, and particularly, the causal amendment of a single one; (2) it keeps the physical description to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. (1 other version)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.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  37. Universal Logic in terms of Quantum Information.Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (9):1-5.
    Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. The Symmetries of Quantum and Classical Information. The Ressurrected “Ether" of Quantum Information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (41):1-36.
    The paper considers the symmetries of a bit of information corresponding to one, two or three qubits of quantum information and identifiable as the three basic symmetries of the Standard model, U(1), SU(2), and SU(3) accordingly. They refer to “empty qubits” (or the free variable of quantum information), i.e. those in which no point is chosen (recorded). The choice of a certain point violates those symmetries. It can be represented furthermore as the choice of a privileged reference frame (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  40. Pure Logic and Higher-order Metaphysics.Christopher Menzel - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. Quantum information as the information of infinite collections or series.Vasil Penchev - 2020 - Information Theory and Research eJournal (Elsevier: SSRN) 1 (14):1-8.
    The quantum information introduced by quantum mechanics is equivalent to a certain generalization of classical information: from finite to infinite series or collections. The quantity of information is the quantity of choices measured in the units of elementary choice. The “qubit”, can be interpreted as that generalization of “bit”, which is a choice among a continuum of alternatives. The axiom of choice is necessary for quantum information. The coherent state is transformed into a well-ordered series of results (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. Wittgenstein's picture theory in the linguistic Copenhagen interpretation of dualistic idealism.Ishikawa Shiro -
    Recently, we have proposed quantum language ( or the linguistic Copenhagen interpretation of quantum mechanics). Quantum languages describe both classical and quantum systems and therefore have great power to solve almost all philosophical problems. Thus, we believe that quantum language can be regarded as the language of science. Therefore, it makes sense to study Wittgenstein's picture theory within the framework of quantum language, since Wittgenstein's language (i.e., the language that he supposed, but didn't define (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. Towards a Logic of Epistemic Theory of Measurement.Daniele Porello & Claudio Macolo - 2019 - In Gabor Bella & Paolo Bouquet (eds.), Modeling and Using Context - 11th International and Interdisciplinary Conference, {CONTEXT} 2019, Trento, Italy, November 20-22, 2019, Proceedings. Lecture Notes in Computer Science 11939. pp. 175-188.
    We propose a logic to reason about data collected by a num- ber of measurement systems. The semantic of this logic is grounded on the epistemic theory of measurement that gives a central role to measure- ment devices and calibration. In this perspective, the lack of evidences (in the available data) for the truth or falsehood of a proposition requires the introduction of a third truth-value (the undetermined). Moreover, the data collected by a given source are here represented (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44.  91
    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  
  45. Wittgenstein's Attitudes.Fabien Schang - 2008 - In Alexander Hieke & Hannes Leitgeb (eds.), Reduktion und Elimination in Philosophie und den Wissenschaften. pp. 289-291.
    What's wrong with modalities in (Wittgenstein 1922)? In (Suszko 1968), the writer argued that "Wittgenstein was somewhat confused and wrong in certain points. For example, he did not see the clear-cut distinction between language (theory) and metalanguage (metatheory): a confusion between use and mention of expressions". Furthermore, a modal logic was proposed in (von Wright 1986) as depicting Wittgenstein's bipolarity thesis in a S5 frame. -/- The aim of the present paper is to deal with the specific case of epistemic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. analítica revista de filosofía.Gabriel Garduño-Soto - 2015 - Analítica. Revista de Filosofía 9:69-112.
    The complete arithmetization of the bivalued propositional logic is here presented and extended with original functions not hitherto included in other interpretations of propositional logic, as the algebraic logic or sets theory. An historical review of the former attempts of arithmetical representation of the propositional logic is presented.
    Download  
     
    Export citation  
     
    Bookmark  
  47. Topics in the Proof Theory of Non-classical Logics. Philosophy and Applications.Fabio De Martin Polo - 2023 - Dissertation, Ruhr-Universität Bochum
    Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Propositional Logic – A Primer.Leslie Allan - manuscript
    This tutorial is for beginners wanting to learn the basics of propositional logic; the simplest of the formal systems of logic. Leslie Allan introduces students to the nature of arguments, validity, formal proofs, logical operators and rules of inference. With many examples, Allan shows how these concepts are employed through the application of three different methods for proving the formal validity of arguments.
    Download  
     
    Export citation  
     
    Bookmark  
  49. Ancient logic and its modern interpretations.John Corcoran (ed.) - 1974 - Boston,: Reidel.
    This book treats ancient logic: the logic that originated in Greece by Aristotle and the Stoics, mainly in the hundred year period beginning about 350 BCE. Ancient logic was never completely ignored by modern logic from its Boolean origin in the middle 1800s: it was prominent in Boole’s writings and it was mentioned by Frege and by Hilbert. Nevertheless, the first century of mathematical logic did not take it seriously enough to study the ancient logic texts. A renaissance in (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  50. Consistency proof of a fragment of pv with substitution in bounded arithmetic.Yoriyuki Yamagata - 2018 - Journal of Symbolic Logic 83 (3):1063-1090.
    This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and either (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 944