Results for 'mathematically equivalent theories'

999 found
Order:
  1.  44
    Two Mathematically Equivalent Versions of Maxwell’s Equations.Tepper L. Gill & Woodford W. Zachary - 2011 - Foundations of Physics 41 (1):99-128.
    This paper is a review of the canonical proper-time approach to relativistic mechanics and classical electrodynamics. The purpose is to provide a physically complete classical background for a new approach to relativistic quantum theory. Here, we first show that there are two versions of Maxwell’s equations. The new version fixes the clock of the field source for all inertial observers. However now, the (natural definition of the effective) speed of light is no longer an invariant for all observers, but depends (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  73
    Incompatible empirically equivalent theories: A structural explication.Thomas Mormann - 1995 - Synthese 103 (2):203 - 249.
    The thesis of the empirical underdetermination of theories (U-thesis) maintains that there are incompatible theories which are empirically equivalent. Whether this is an interesting thesis depends on how the term incompatible is understood. In this paper a structural explication is proposed. More precisely, the U-thesis is studied in the framework of the model theoretic or emantic approach according to which theories are not to be taken as linguistic entities, but rather as families of mathematical structures. (...) of similarity structures are studied as a paradigmatic case. The structural approach further reveals that the U-thesis is related to problems of uniqueness in the representational theory of measurement, questions of geometric conventionalism, and problems of structural underdetermination in mathematics. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3. The Mathematical Theory of Categories in Biology and the Concept of Natural Equivalence in Robert Rosen.Franck Varenne - 2013 - Revue d'Histoire des Sciences 66 (1):167-197.
    The aim of this paper is to describe and analyze the epistemological justification of a proposal initially made by the biomathematician Robert Rosen in 1958. In this theoretical proposal, Rosen suggests using the mathematical concept of “category” and the correlative concept of “natural equivalence” in mathematical modeling applied to living beings. Our questions are the following: According to Rosen, to what extent does the mathematical notion of category give access to more “natural” formalisms in the modeling of living beings? Is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  56
    A review on possible physical meaning of elastic-electromagnetic mathematical equivalences.Florentin Smarandache - manuscript
    It is known, despite special theory of relativity has been widely accepted, in our recent draft submitted to this journal it is shown that some experiments have been carried out suggesting superluminal wave propagation, which make Minkowski lightcone not valid anymore. Therefore, it seems worth to reconsider the connection between elastic wave and electromagnetic wave equations, as in their early development. In this paper we will start with Maxwell-Dirac isomorphism, then we will find its connection with elastic wave equations.
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  13
    Classification Theory: Proceedings of the U.S.-Israel Workshop on Model Theory in Mathematical Logic Held in Chicago, Dec. 15-19, 1985.J. T. Baldwin & U. Workshop on Model Theory in Mathematical Logic - 1987 - Springer.
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  31
    Mathematical Objects arising from Equivalence Relations and their Implementation in Quine's NF.Thomas Forster - 2016 - Philosophia Mathematica 24 (1):nku005.
    Many mathematical objects arise from equivalence classes and invite implementation as those classes. Set-existence principles that would enable this are incompatible with ZFC's unrestricted aussonderung but there are set theories which admit more instances than does ZF. NF provides equivalence classes for stratified relations only. Church's construction provides equivalence classes for “low” sets, and thus, for example, a set of all ordinals. However, that set has an ordinal in turn which is not a member of the set constructed; so (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  15
    Mathematical Objects arising from Equivalence Relations and their Implementation in Quine's NF.Thomas Forster - 2016 - Philosophia Mathematica 24 (1):50-59.
    Many mathematical objects arise from equivalence classes and invite implementation as those classes. Set-existence principles that would enable this are incompatible with ZFC's unrestricted _aussonderung_ but there are set theories which admit more instances than does ZF. NF provides equivalence classes for stratified relations only. Church's construction provides equivalence classes for "low" sets, and thus, for example, a set of all ordinals. However, that set has an ordinal in turn which is not a member of the set constructed; so (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  25
    A Kantian account of mathematical modelling and the rationality of scientific theory change: The role of the equivalence principle in the development of general relativity.Jonathan Everett - 2018 - Studies in History and Philosophy of Science Part A 71:45-57.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  19
    Ore Oystein. Theory of equivalence relations. Duke mathematical journal, vol. 9 , pp. 573–627.J. C. C. McKinsey - 1943 - Journal of Symbolic Logic 8 (2):55-56.
  10. General Theory of Natural Equivalences.Saunders MacLane & Samuel Eilenberg - 1945 - Transactions of the American Mathematical Society:231-294.
     
    Export citation  
     
    Bookmark   89 citations  
  11. A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12.  19
    Complexity of distances: Theory of generalized analytic equivalence relations.Marek Cúth, Michal Doucha & Ondřej Kurka - 2022 - Journal of Mathematical Logic 23 (1).
    We generalize the notion of analytic/Borel equivalence relations, orbit equivalence relations, and Borel reductions between them to their continuous and quantitative counterparts: analytic/Borel pseudometrics, orbit pseudometrics, and Borel reductions between them. We motivate these concepts on examples and we set some basic general theory. We illustrate the new notion of reduction by showing that the Gromov–Hausdorff distance maintains the same complexity if it is defined on the class of all Polish metric spaces, spaces bounded from below, from above, and from (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  31
    Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
    The main result of this paper is the equivalence of several definition schemas of bar recursion occurring in the literature on functionals of finite type. We present the theory of functionals of finite type, in [T] denoted byqf-WE-HA ω, which is necessary for giving the equivalence proofs. Moreover we prove two results on this theory that cannot be found in the literature, namely the deduction theorem and a derivation of Spector's rule of extensionality from [S]: ifP→T 1=T 2 and Q[X∶≡T1], (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14. Théorie mathématique des catégories en biologie et notion d’équivalence naturelle chez Robert Rosen.Franck Varenne - 2013 - Revue d'Histoire des Sciences 66 (1):167-197.
    The aim of this paper is to describe and analyze the epistemological justification of a proposal initially made by the bio-mathematician Robert Rosen in 1958. In this theoretical proposal, Rosen suggests using the mathematical concept of « category » and the correlative concept of « natural equivalence » in mathematical modeling applied to living beings. Our questions are the following: according to Rosen, to what extent does the mathematical notion of category give access to more « natural » formalisms in (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  15.  85
    The equivalence of theories that characterize ALogTime.Phuong Nguyen - 2009 - Archive for Mathematical Logic 48 (6):523-549.
    A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory ${{\bf S}^{1}_{2}}$ characterizes polytime functions. Among these, ALV′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation group S 5 is complete for ALogTime. On the other hand, ALV (by Clote), T 0 NC (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  27
    Courcelle B.. Equational theories and equivalences of programs. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 289–302.de Barker J. W. and Zucker J. I.. Derivatives of programs. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 321–343.Engeler E.. An algorithmic model of strict finitism. Mathematical logic in computer science, edited by Dömölki B. and Gergely T., Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 345–357. [REVIEW]Steven S. Muchnick - 1984 - Journal of Symbolic Logic 49 (3):990-991.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  63
    A mathematical characterization of interpretation between theories.J. Van Benthem - 1984 - Studia Logica 43:295.
    Of the various notions of reduction in the logical literature, relative interpretability in the sense of Tarskiet al. [6] appears to be the central one. In the present note, this syntactic notion is characterized semantically, through the existence of a suitable reduction functor on models. The latter mathematical condition itself suggests a natural generalization, whose syntactic equivalent turns out to be a notion of interpretability quite close to that of Ershov [1], Szczerba [5] and Gaifman [2].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  18.  6
    Elementary Equivalence and Constructible Models of Zermelo‐Fraenkel Set Theory.R. H. Cowen - 1976 - Mathematical Logic Quarterly 22 (1):333-338.
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  15
    Risk and theoretical equivalence in mathematical foundations.Toby Meadows - 2023 - Synthese 202 (5):1-35.
    Consistency, interpretability and probability are three key instruments in the mathematical philosopher’s kit when it comes to questions of foundational theory comparison. This paper aims to bring these tools together with a focus on theories capable of providing foundations for mathematics with a particular emphasis on set theory. A number of counterintuitive results emerge which are then addressed by offering a novel framework based on what we call pointwise interpretability. We then investigate a plausible, existing instance of this framework, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Necessitism, Contingentism, and Theory Equivalence.Bruno Jacinto - 2021 - Bulletin of Symbolic Logic 27 (2):217-218.
    Necessitism, Contingentism, and Theory Equivalence is a dissertation on issues in higher-order modal metaphysics. Consider a modal higher-order language with identity in which the universal quantifier is interpreted as expressing universal quantification and the necessity operator is interpreted as expressing metaphysical necessity. The main question addressed in the dissertation concerns the correct theory formulated in this language. A different question that also takes centre stage in the dissertation is what it takes for theories to be equivalent.The whole dissertation (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  16
    Euclid’s Common Notions and the Theory of Equivalence.Vincenzo De Risi - 2020 - Foundations of Science 26 (2):301-324.
    The “common notions” prefacing the Elements of Euclid are a very peculiar set of axioms, and their authenticity, as well as their actual role in the demonstrations, have been object of debate. In the first part of this essay, I offer a survey of the evidence for the authenticity of the common notions, and conclude that only three of them are likely to have been in place at the times of Euclid, whereas others were added in Late Antiquity. In the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22.  67
    The Limits of Physical Equivalence in Algebraic Quantum Field Theory.Tracy Lupher - 2016 - British Journal for the Philosophy of Science 69 (2):553-576.
    Some physicists and philosophers argue that unitarily inequivalent representations in quantum field theory are mathematical surplus structure. Support for that view, sometimes called ‘algebraic imperialism’, relies on Fell’s theorem and its deployment in the algebraic approach to QFT. The algebraic imperialist uses Fell’s theorem to argue that UIRs are ‘physically equivalent’ to each other. The mathematical, conceptual, and dynamical aspects of Fell’s theorem will be examined. Its use as a criterion for physical equivalence is examined in detail and it (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  89
    Why were two theories (matrix mechanics and wave mechanics) deemed logically distinct, and yet equivalent, in quantum mechanics?Slobodan Perovic - 2007 - In Christopher Lehrer (ed.), First Annual Conference in the Foundations and History of Quantum Physics. Max Planck Institute for History of Science.
    A recent rethinking of the early history of Quantum Mechanics deemed the late 1920s agreement on the equivalence of Matrix Mechanics and Wave Mechanics, prompted by Schrödinger’s 1926 proof, a myth. Schrödinger supposedly failed to achieve the goal of proving isomorphism of the mathematical structures of the two theories, while only later developments in the early 1930s, especially the work of mathematician John von Neumman (1932) provided sound proof of equivalence. The alleged agreement about the Copenhagen Interpretation, predicated to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  40
    Mathematical logic.Heinz-Dieter Ebbinghaus - 1996 - New York: Springer. Edited by Jörg Flum & Wolfgang Thomas.
    This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most (...)
    Direct download  
     
    Export citation  
     
    Bookmark   46 citations  
  25.  9
    The equivalence of Axiom (∗)+ and Axiom (∗)++.W. Hugh Woodin - forthcoming - Journal of Mathematical Logic.
    Asperó and Schindler have completely solved the Axiom [Formula: see text] vs. [Formula: see text] problem. They have proved that if [Formula: see text] holds then Axiom [Formula: see text] holds, with no additional assumptions. The key question now concerns the relationship between [Formula: see text] and Axiom [Formula: see text]. This is because the foundational issues raised by the problem of Axiom [Formula: see text] vs. [Formula: see text] arguably persist in the problem of Axiom [Formula: see text] vs. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  41
    Ilijas Farah, Bradd Hart, and David Sherman. Model theory of operator algebras I: stability_. Bulletin of the London Mathematical Society, vol. 45 (2013), no. 4, pp. 825–838, doi:10.1112/blms/bdt014. - Ilijas Farah, Bradd Hart, and David Sherman. _Model theory of operator algebras II: model theory_. Israel Journal of Mathematics, vol. 201 (2014), no. 1, pp. 477–505, doi:10.1007/s11856-014-1046-7. - Ilijas Farah, Bradd Hart, and David Sherman. _Model theory of operator algebras III: elementary equivalence and_ II 1 _factors_. Bulletin of the London Mathematical Society, vol. 46 (2014), no. 3, pp. 609–628, doi:10.1112/blms/bdu012. - Isaac Goldbring, Bradd Hart, and Thomas Sinclair. _The theory of tracial von Neumann algebras does not have a model companion. Journal of Symbolic Logic, vol. 78 (2013), no. 3, pp. 1000–1004. [REVIEW]Itaï Ben Yaacov - 2015 - Bulletin of Symbolic Logic 21 (4):425-427.
  27.  51
    James Cummings and Ernest Schimmerling, editors. Lecture Note Series of the London Mathematical Society, vol. 406. Cambridge University Press, New York, xi + 419 pp. - Paul B. Larson, Peter Lumsdaine, and Yimu Yin. An introduction to Pmax forcing. pp. 5–23. - Simon Thomas and Scott Schneider. Countable Borel equivalence relations. pp. 25–62. - Ilijas Farah and Eric Wofsey. Set theory and operator algebras. pp. 63–119. - Justin Moore and David Milovich. A tutorial on set mapping reflection. pp. 121–144. - Vladimir G. Pestov and Aleksandra Kwiatkowska. An introduction to hyperlinear and sofic groups. pp. 145–185. - Itay Neeman and Spencer Unger. Aronszajn trees and the SCH. pp. 187–206. - Todd Eisworth, Justin Tatch Moore, and David Milovich. Iterated forcing and the Continuum Hypothesis. pp. 207–244. - Moti Gitik and Spencer Unger. Short extender forcing. pp. 245–263. - Alexander S. Kechris and Robin D. Tucker-Drob. The complexity of classification problems in ergodic theory. pp. 265–29. [REVIEW]Natasha Dobrinen - 2014 - Bulletin of Symbolic Logic 20 (1):94-97.
  28.  7
    James Cummings and Ernest Schimmerling, editors. Lecture Note Series of the London Mathematical Society, vol. 406. Cambridge University Press, New York, xi + 419 pp. - Paul B. Larson, Peter Lumsdaine, and Yimu Yin. An introduction to P max forcing. pp. 5–23. - Simon Thomas and Scott Schneider. Countable Borel equivalence relations. pp. 25–62. - Ilijas Farah and Eric Wofsey. Set theory and operator algebras. pp. 63–119. - Justin Moore and David Milovich. A tutorial on set mapping reflection. pp. 121–144. - Vladimir G. Pestov and Aleksandra Kwiatkowska. An introduction to hyperlinear and sofic groups. pp. 145–185. - Itay Neeman and Spencer Unger. Aronszajn trees and the SCH. pp. 187–206. - Todd Eisworth, Justin Tatch Moore, and David Milovich. Iterated forcing and the Continuum Hypothesis. pp. 207–244. - Moti Gitik and Spencer Unger. Short extender forcing. pp. 245–263. - Alexander S. Kechris and Robin D. Tucker-Drob. The complexity of classification problems in ergodic theory. pp. 265–2. [REVIEW]Natasha Dobrinen - 2014 - Bulletin of Symbolic Logic 20 (1):94-97.
  29. Evidence and the hierarchy of mathematical theories.Charles Parsons - unknown
    It is a well-known fact of mathematical logic, by now developed in considerable detail, that formalized mathematical theories can be ordered by relative interpretability, and the "strength" of a theory is indicated by where it stands in this ordering. Mutual interpretability is an equivalence relation, and what I call an ordering is a partial ordering modulo this equivalence. Of the theories that have been studied, the natural theories belong to a linearly ordered subset of this ordering.
     
    Export citation  
     
    Bookmark  
  30.  38
    Newman M. H. A.. On theories with a combinatorial definition of “equivalence.” Annals of mathematics, ser. 2 vol. 43 , pp. 223–243. [REVIEW]H. E. Vaughan - 1942 - Journal of Symbolic Logic 7 (3):123-123.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  69
    Jack H. Silver. Counting the number of equivalence classes of Borel and coanalytic equivalence relations. Annals of mathematical logic, vol. 18 , pp. 1–28. - John P. Burgess. Equivalences generated by families of Borel sets. Proceedings of the American Mathematical Society. vol. 69 , pp. 323–326. - John P. Burgess. A reflection phenomenon in descriptive set theory. Fundamenta mathematicae. vol. 104 , pp. 127–139. - L. Harrington and R. Sami. Equivalence relations, projective and beyond. Logic Colloquium '78, Proceedings of the Colloquium held in Mons, August 1978, edited by Maurice Boffa, Dirk van Dalen, and Kenneth McAloon, Studies in logic and the foundations of mathematics, vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, pp. 247–264. - Leo Harrington and Saharon Shelah. Counting equivalence classes for co-κ-Souslin equivalence relations. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edit. [REVIEW]Alain Louveau - 1987 - Journal of Symbolic Logic 52 (3):869-870.
  32.  39
    S. Feferman and W. Sieg Inductive definitions and subsystems of analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–77. - Solomon Feferman and Wilfried Sieg. Proof theoretic equivalences between classical and constructive theories for analysis. Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, by Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Lecture notes in mathematics, vol. 897, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 78–142. - Solomon Feferman. Iterated inductive fixed-point theories: application to Hancock's conjecture. Patras logic symposion, Proceedings of the logic symposion held at Patras, Greece, August 18–22, 1980, edited by George Metakides, Studies in logic. [REVIEW]Helmut Pfeiffer - 1994 - Journal of Symbolic Logic 59 (2):668-670.
  33.  28
    Richard A. Shore. Determining automorphisms of the recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 65 , pp. 318– 325. - Richard A. Shore. The homogeneity conjecture. Proceedings of the National Academy of Sciences of the United States of America, vol. 76 , pp. 4218– 4219. - Richard A. Shore. On homogeneity and definability in the first-order theory of the Turing degrees. The journal of symbolic logic, vol. 47 , pp. 8– 16. - Richard A. Shore. The arithmetic and Turing degrees are not elementarily equivalent. Archiv für mathematische Logik und Grundlagenforschung, vol. 24 , pp. 137– 139. - Richard A. Shore. The structure of the degrees of unsolvabitity. Recursion theory, edited by Anil Nerode and Richard A. Shore, Proceedings of symposia in pure mathematics, vol. 42, American Mathematical Society, Providence1985, pp. 33– 51. - Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois journal of mathematics, vol. 30 , pp. 320–. [REVIEW]Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.
  34.  36
    Karp Carol R.. Finite-quantifier equivalence. The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by Addison J. W., Henkin Leon, and Tarski Alfred, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 407–412. [REVIEW]H. Jerome Keisler - 1971 - Journal of Symbolic Logic 36 (1):158.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  23
    Equivalence and Priority: Newton Versus Leibniz: Including Leibniz's Unpublished Manuscript on the Principia.Domenico Bertoloni Meli - 1992 - Oxford University Press UK.
    Leibniz's dispute with Newton over the physico-mathematical theories expounded in the Principia Mathematica have long been identified as a crucial episode in the history of science. Dr. Bertoloni Meli examines several hitherto unpublished manuscripts in Leibniz's own hand illustrating his first reading of and reaction to Newton's Principia. Six of the most important manuscripts are here edited for the first time. Contrary to Leibniz's own claims, this new evidence shows that he had studied Newton's masterpiece before publishing An Essay (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  14
    Contributions to the theory of semisets: III absolute sets, absolute equivalence and iterations of class‐mappings in the theory of semisets.Karel Čuda - 1973 - Mathematical Logic Quarterly 19 (26‐29):399-406.
  37.  16
    A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation.Arief Daynes - 2000 - Archive for Mathematical Logic 39 (8):581-598.
    The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  26
    A Language for Category Theory in which Natural Equivalence Implies Elementary Equivalence of Models.A. Preller - 1985 - Mathematical Logic Quarterly 31 (14‐18):227-234.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  27
    A Language for Category Theory in which Natural Equivalence Implies Elementary Equivalence of Models.A. Preller - 1985 - Mathematical Logic Quarterly 31 (14-18):227-234.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  18
    On A Theorem Equivalent to Post's Fundamental Theorem of Recursive Function Theory.Albert A. Mullin - 1963 - Mathematical Logic Quarterly 9 (12‐15):203-205.
  41. A Lattice of Chapters of Mathematics.Jan Mycielski, Pavel Pudlák, Alan S. Stern & American Mathematical Society - 1990 - American Mathematical Society.
     
    Export citation  
     
    Bookmark   7 citations  
  42.  35
    Spacetime and Physical Equivalence.Sebastian De Haro - unknown
    In this essay I begin to lay out a conceptual scheme for: analysing dualities as cases of theoretical equivalence; assessing when cases of theoretical equivalence are also cases of physical equivalence. The scheme is applied to gauge/gravity dualities. I expound what I argue to be their contribution to questions about: the nature of spacetime in quantum gravity; broader philosophical and physical discussions of spacetime. - proceed by analysing duality through four contrasts. A duality will be a suitable isomorphism between models: (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  43. The equivalence myth of quantum mechanics —Part I.F. A. Muller - 1997 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 28 (1):35-61.
    The author endeavours to show two things: first, that Schrödingers (and Eckarts) demonstration in March (September) 1926 of the equivalence of matrix mechanics, as created by Heisenberg, Born, Jordan and Dirac in 1925, and wave mechanics, as created by Schrödinger in 1926, is not foolproof; and second, that it could not have been foolproof, because at the time matrix mechanics and wave mechanics were neither mathematically nor empirically equivalent. That they were is the Equivalence Myth. In order to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  44. The equivalence myth of quantum mechanics—part II.F. A. Muller - 1997 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 28 (2):219-247.
    The author endeavours to show two things: first, that Schrödingers (and Eckarts) demonstration in March (September) 1926 of the equivalence of matrix mechanics, as created by Heisenberg, Born, Jordan and Dirac in 1925, and wave mechanics, as created by Schrödinger in 1926, is not foolproof; and second, that it could not have been foolproof, because at the time matrix mechanics and wave mechanics were neither mathematically nor empirically equivalent. That they were is the Equivalence Myth. In order to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  45.  27
    Quineanism, Noneism and Metaphysical Equivalence.Bruno Jacinto & Javier Belastegui - forthcoming - Studia Logica.
    In this paper we propose and defend the Synonymy account, a novel account of metaphysical equivalence which draws on the idea (Rayo in The Construction of Logical Space, Oxford University Press, Oxford, 2013) that part of what it is to formulate a theory is to lay down a theoretical hypothesis concerning logical space. Roughly, two theories are synonymous—and so, in our view, equivalent—just in case (i) they take the same propositions to stand in the same entailment relations, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  52
    Elementary equivalence of some rings of definable functions.Vincent Astier - 2008 - Archive for Mathematical Logic 47 (4):327-340.
    We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theories are always decidable. We then show that, under some hypotheses, the map sending an L-structure R to the L-structure of definable functions from R n to R preserves elementary inclusions and equivalences and gives a structure with a decidable theory whenever R is decidable. We briefly consider structures of definable functions satisfying an extra (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  77
    On the foundations of constructive mathematics – especially in relation to the theory of continuous functions.Frank Waaldijk - 2004 - Foundations of Science 10 (3):249-324.
    We discuss the foundations of constructive mathematics, including recursive mathematics and intuitionism, in relation to classical mathematics. There are connections with the foundations of physics, due to the way in which the different branches of mathematics reflect reality. Many different axioms and their interrelationship are discussed. We show that there is a fundamental problem in BISH (Bishop’s school of constructive mathematics) with regard to its current definition of ‘continuous function’. This problem is closely related to the definition in BISH of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48.  58
    On elementary equivalence in fuzzy predicate logics.Pilar Dellunde & Francesc Esteva - 2013 - Archive for Mathematical Logic 52 (1-2):1-17.
    Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  68
    Advances in Contemporary Logic and Computer Science: Proceedings of the Eleventh Brazilian Conference on Mathematical Logic, May 6-10, 1996, Salvador, Bahia, Brazil.Walter A. Carnielli, Itala M. L. D'ottaviano & Brazilian Conference on Mathematical Logic - 1999 - American Mathematical Soc..
    This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and were revised and updated (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  19
    Equivalence relations and determinacy.Logan Crone, Lior Fishman & Stephen Jackson - 2022 - Journal of Mathematical Logic 22 (1).
    We introduce the notion of -determinacy for Γ a pointclass and E an equivalence relation on a Polish space X. A case of particular interest is the case when E = EG is the shift-action o...
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 999