Contents
183 found
Order:
1 — 50 / 183
  1. Extension, Translation, and the Cantor-Bernstein Property.Thomas William Barrett & Hans Halvorson - manuscript
    The purpose of this paper is to examine in detail a particularly interesting pair of first-order theories. In addition to clarifying the overall geography of notions of equivalence between theories, this simple example yields two surprising conclusions about the relationships that theories might bear to one another. In brief, we see that theories lack both the Cantor-Bernstein and co-Cantor-Bernstein properties.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. What makes a `good' modal theory of sets?Neil Barton - manuscript
    I provide an examination and comparison of modal theories for underwriting different non-modal theories of sets. I argue that there is a respect in which the `standard' modal theory for set construction---on which sets are formed via the successive individuation of powersets---raises a significant challenge for some recently proposed `countabilist' modal theories (i.e. ones that imply that every set is countable). I examine how the countabilist can respond to this issue via the use of regularity axioms and raise some questions (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Foundations of Metaphysical Cosmology : Type System and Computational Experimentation.Elliott Bonal - manuscript
    The ambition of this paper is extensive: to bring about a new paradigm and firm mathematical foundations to Metaphysics, to aid its progress from the realm of mystical speculation to the realm of scientific scrutiny. -/- More precisely, this paper aims to introduce the field of Metaphysical Cosmology. The Metaphysical Cosmos here refers to the complete structure containing all entities, both existent and non-existent, with the physical universe as a subset. Through this paradigm, future endeavours in Metaphysical Science could thus (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Inconsistency of ℕ with the set union operation.Enrico Pier Giorgio Cadeddu - manuscript
    A contradiction is obtained, considering the axiom of infinity, then ℕ and Peano axioms, together a list of ℕ subsets and with inclusion relation and union operation. Natural numbers constitute an infinite set, ℕ, but we show the union of its proper subsets, with a specific form, isn’t an infinite set. Also we get a simpler explanation and a symbolic representation. Lastly, inconsistency of Peano successor axiom is a consequence of rejecting infinity.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Inconsistency of ℕ and the question of infinity.Enrico Pier Giorgio Cadeddu - manuscript
    In the article ”Inconsistency of N from a not-finitist point of view” we have shown the inconsistency of N, going through a denial. Here we delete this indirect step and essentially repeat the same proof. Contextually we find a contradiction about natural number definition. Then we discuss around the rejection of infinity.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. A BIBLIOGRAPHY: JOHN CORCORAN's PUBLICATIONS ON ARISTOTLE 1972–2015.John Corcoran - manuscript
    This presentation includes a complete bibliography of John Corcoran’s publications devoted at least in part to Aristotle’s logic. Sections I–IV list 20 articles, 43 abstracts, 3 books, and 10 reviews. It starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article that antedates Corcoran’s Aristotle’s studies and the Journal of Symbolic Logic article first reporting his original results; it ends with works published in 2015. A few of the items are annotated with endnotes connecting them with (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. (1 other version)Zeno Paradox, Unexpected Hanging Paradox (Modeling of Reality & Physical Reality, A Historical-Philosophical view).Farzad Didehvar - manuscript
    . In our research about Fuzzy Time and modeling time, "Unexpected Hanging Paradox" plays a major role. Here, we compare this paradox to the Zeno Paradox and the relations of them with our standard models of continuum and Fuzzy numbers. To do this, we review the project "Fuzzy Time and Possible Impacts of It on Science" and introduce a new way in order to approach the solutions for these paradoxes. Additionally, we have a more general discussion about paradoxes, as Philosophical (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Computational reverse mathematics and foundational analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. Partitions and Objective Indefiniteness.David Ellerman - manuscript
    Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. Algunos tópicos de Lógica matemática y los Fundamentos de la matemática.Franklin Galindo - manuscript
    En este trabajo matemático-filosófico se estudian cuatro tópicos de la Lógica matemática: El método de construcción de modelos llamado Ultraproductos, la Propiedad de Interpolación de Craig, las Álgebras booleanas y los Órdenes parciales separativos. El objetivo principal del mismo es analizar la importancia que tienen dichos tópicos para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático. Para cumplir con tal objetivo se trabajará en el ámbito de la Matemática, de la Metamatemática y (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Soundness does not come for free (if at all).Kaave Lajevardi & Saeed Salehi - manuscript
    We respond to some of the points made by Bennet and Blanck (2022) concerning a previous publication of ours (2021).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic. Part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  13. Random Formula Generators.Ariel Jonathan Roffé & Joaquín Toranzo Calderón - manuscript
    In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. The Well-Ordered Society under Crisis: A Formal Analysis of Public Reason vs. Convergence Discourse.Hun Chung - forthcoming - American Journal of Political Science:1-20.
    A well-ordered society faces a crisis whenever a sufficient number of noncompliers enter into the political system. This has the potential to destabilize liberal democratic political order. This article provides a formal analysis of two competing solutions to the problem of political stability offered in the public reason liberalism literature—namely, using public reason or using convergence discourse to restore liberal democratic political order in the well-ordered society. The formal analyses offered in this article show that using public reason fails completely, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  15. Arrow's theorem, ultrafilters, and reverse mathematics.Benedict Eastaugh - forthcoming - Review of Symbolic Logic.
    This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in RCA0. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in RCA0. This approach yields a proof of Arrow's theorem in RCA0, and (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  16. Infinity, Choice, and Hume's Principle.Stephen Mackereth - forthcoming - Journal of Philosophical Logic.
    It has long been known that in the context of axiomatic second-order logic (SOL), Hume's Principle (HP) is mutually interpretable with "the universe is Dedekind infinite" (DI). I offer a more fine-grained analysis of the logical strength of HP, measured by deductive implications rather than interpretability. The main result is that HP is not deductively conservative over SOL + DI. That is, SOL + HP proves additional theorems in the language of pure second-order logic that are not provable from SOL (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. The Practice-Based Approach to the Philosophy of Logic.Ben Martin - forthcoming - In Oxford Handbook for the Philosophy of Logic. Oxford University Press.
    Philosophers of logic are particularly interested in understanding the aims, epistemology, and methodology of logic. This raises the question of how the philosophy of logic should go about these enquires. According to the practice-based approach, the most reliable method we have to investigate the methodology and epistemology of a research field is by considering in detail the activities of its practitioners. This holds just as true for logic as it does for the recognised empirical and abstract sciences. If we wish (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  18. The Importance of Teaching Logic to Computer Scientists and Electrical Engineers.Paul Mayer - forthcoming - IEEE.
    It is argued that logic, and in particular mathematical logic, should play a key role in the undergraduate curriculum for students in the computing fields, which include electrical engineering (EE), computer engineering (CE), and computer science (CS). This is based on 1) the history of the field of computing and its close ties with logic, 2) empirical results showing that students with better logical thinking skills perform better in tasks such as programming and mathematics, and 3) the skills students are (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. Categorical Quantification.Constantin C. Brîncuş - 2024 - Bulletin of Symbolic Logic 30 (2):pp. 227-252.
    Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  20. Inferential Quantification and the ω-rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345--372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. Inferential Quantification and the ω-Rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345-372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Constructive Type Theory, an appetizer.Laura Crosilla - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    Recent debates in metaphysics have highlighted the significance of type theories, such as Simple Type Theory (STT), for our philosophical analysis. In this chapter, I present the salient features of a constructive type theory in the style of Martin-Löf, termed CTT. My principal aim is to convey the flavour of this rich, flexible and sophisticated theory and compare it with STT. I especially focus on the forms of quantification which are available in CTT. A further aim is to argue that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  23. A defense of Isaacson’s thesis, or how to make sense of the boundaries of finite mathematics.Pablo Dopico - 2024 - Synthese 203 (2):1-22.
    Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  24. The purely iterative conception of set.Ansten Klev - 2024 - Philosophia Mathematica 32 (3):358-378.
    According to the iterative conception of set, sets are formed in stages. According to the purely iterative conception of set, sets are formed by iterated application of a set-of operation. The cumulative hierarchy is a mathematical realization of the iterative conception of set. A mathematical realization of the purely iterative conception can be found in Peter Aczel’s type-theoretic model of constructive set theory. I will explain Aczel’s model construction in a way that presupposes no previous familiarity with the theories on (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. (2 other versions)How Do I Know That I Know Nothing? The Axiom of Selection and the Arithmetic of Infinity.Matheus Pereira Lobo - 2024 - Open Journal of Mathematics and Physics 6:288.
    We show that the statement "I only know that I know nothing," attributed to the Greek philosopher Socrates, contains, at its core, Zermelo's Axiom of Selection and the arithmetic of the infinite cardinal aleph-0.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  26. Foundation of Appurtenance and Inclusion Equations for Constructing the Operations of Neutrosophic Numbers Needed in Neutrosophic Statistics Foundation of Appurtenance and Inclusion Equations for Constructing the Operations of Neutrosophic Numbers Needed in Neutrosophic Statistics.Florentin Smarandache - 2024 - Neutrosophic Systems with Applications 15.
    We introduce for the first time the appurtenance equation and inclusion equation, which help in understanding the operations with neutrosophic numbers within the frame of neutrosophic statistics. The way of solving them resembles the equations whose coefficients are sets (not single numbers).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. Proceedings of the International Conference on Neutrosophy and Plithogeny: Fundamentals and Applications, Lima, Peru, 8-9 July 2024.Florentin Smarandache, Mohamed Abdel-Basset, Maikel Yelandi Leyva Vazquez & Said Broumi (eds.) - 2024
    A special issue of the International Journal in Information Science and Engineering “Neutrosophic Sets and Systems” (vol. 69/2024) is dedicated to the Neutrosophic approaches in research, on the occasion of the international and multidisciplinary conference held at the Universidad César Vallejo in Lima, Peru, on July 8 and 9. This event marks a significant milestone, as it is the first time that the Andean region and Latin America host scholars and researchers dedicated to studying various theoretical and applicative issues in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  28. Assessing Quality of Life Indicators in Contemporary Buildings in Kruja, Albania: A Regression Model Approach.Klodjan Xhexhi & Almida Xhexhi - 2024 - European Journal of Management Issues 32 (3):194-205.
    Purpose: This article aims to highlight key indicators of residents' quality of life in a specific contemporary building in Kruja, Albania. -/- Design/Method/Approach: A questionnaire with 30 questions was prepared for the inhabitance, and the Binary or Tobit probabilistic models were taken into consideration as part of the methodology, to conclude. The study will further analyze the implications of the inhabitants and their behavior in a specific contemporary building in the city of Kruja. It was examined the statistical significance of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  29. Formal differential variables and an abstract chain rule.Samuel Alexander - 2023 - Proceedings of the ACMS 23.
    One shortcoming of the chain rule is that it does not iterate: it gives the derivative of f(g(x)), but not (directly) the second or higher-order derivatives. We present iterated differentials and a version of the multivariable chain rule which iterates to any desired level of derivative. We first present this material informally, and later discuss how to make it rigorous (a discussion which touches on formal foundations of calculus). We also suggest a finite calculus chain rule (contrary to Graham, Knuth (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. 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.Bruno Bentzen, Beishui Liao, Davide Liga, Reka Markovich, Bin Wei, Minghui Xiong & Tianwen Xu (eds.) - 2023 - College Publications.
    This comprehensive volume features the proceedings of the Third International Workshop on Logics for New-Generation Artificial Intelligence and the International Workshop on Logic, AI and Law, held in Hangzhou, China on September 8-9 and 11-12, 2023. The collection offers a diverse range of papers that explore the intersection of logic, artificial intelligence, and law. With contributions from some of the leading experts in the field, this volume provides insights into the latest research and developments in the applications of logic in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  31. Inconcistency of ℕ from a not-finitist point of view.Enrico Pier Giorgio Cadeddu - 2023 - International Journal of Modern Research in Engineering and Technology 8 (10):2.
    Considering the set of natural numbers ℕ, then in the context of Peano axioms, starting from inequalities between finite sets, we find a fundamental contradiction, about the existence of ℕ, from a not-finitist point of view.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  32. 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 with (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  33. Logicism and Theory of Coherence in Bertrand Russell's Thought.Adimike J. O. E. - 2023 - Bodija Journal: A Philosophico-Theological Journal 13:1-14.
    Logicism is the thesis that all or, at least parts, of mathematics is reducible to deductive logic in at least two senses: (A) that mathematical lexis can be defined by sole recourse to logical constants [a definition thesis]; and, (B) that mathematical theorems are derivable from solely logical axioms [a derivation thesis]. The principal proponents of this thesis are: Frege, Dedekind, and Russell. The central question that I raise in this paper is the following: ‘How did Russell construe the philosophical (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  34. Graphical Method for Solving Neutrosophical Nonlinear Programming Models.Maissam Jdid & Florentin Smarandache - 2023 - Neutrosophic Systems with Applications 9.
    An important method for finding the optimal solution for linear and nonlinear models is the graphical method, which is used if the linear or nonlinear mathematical model contains one, two, or three variables. The models that contain only two variables are among the most models for which the optimal solution has been obtained graphically, whether these models are linear or non-linear in references and research that are concerned with the science of operations research, when the data of the issue under (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  35. An Approach to QST-based Nmatrices Semantics.Juan Pablo Jorge, Federico Holik & Décio Krause - 2023 - Principia: An International Journal of Epistemology 27 (3):539-607.
    This paper introduces the theory QST of quasets as a formal basis for the Nmatrices. The main aim is to construct a system of Nmatrices by substituting standard sets by quasets. Since QST is a conservative extension of ZFA (the Zermelo-Fraenkel set theory with Atoms), it is possible to obtain generalized Nmatrices (Q-Nmatrices). Since the original formulation of QST is not completely adequate for the developments we advance here, some possible amendments to the theory are also considered. One of the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  36. 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   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. The Decision Problem for Effective Procedures.Nathan Salmón - 2023 - Logica Universalis 17 (2):161-174.
    The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Introduction to the MultiNeutrosophic Set.Florentin Smarandache - 2023 - Neutrosophic Sets and Systems 61:89-99.
    In the real word, in most cases, everything (an attribute, event, proposition, theory, idea, person, object, action, etc.) is evaluated in general by many sources (called experts), not only one. The more sources evaluate a subject, the better accurate result (after fusioning all evaluations). That’s why, in this paper, we straightforwardly extend the Refined Neutrosophic Set to the MultiNeutrosophic Set, and we show that the last two are isomorphic. A MultiNeutrosophic Set is a Neutrosophic Set whose all elements’ degrees of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  39. A few little steps beyond Knuth’s Boolean Logic Table with Neutrosophic Logic: A Paradigm Shift in Uncertain Computation.Florentin Smarandache & Victor Christianto - 2023 - Prospects for Applied Mathematics and Data Analysis 2 (2):22-26.
    The present article delves into the extension of Knuth’s fundamental Boolean logic table to accommodate the complexities of indeterminate truth values through the integration of neutrosophic logic (Smarandache & Christianto, 2008). Neutrosophic logic, rooted in Florentin Smarandache’s groundbreaking work on Neutrosophic Logic (cf. Smarandache, 2005, and his other works), introduces an additional truth value, ‘indeterminate,’ enabling a more comprehensive framework to analyze uncertainties inherent in computational systems. By bridging the gap between traditional boolean operations and the indeterminacy present in various (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  40. Evitable iterates of the consistency operator.James Walsh - 2023 - Computability 12 (1):59--69.
    Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator ``in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. Operator Counterparts of Types of Reasoning.Urszula Wybraniec-Skardowska - 2023 - Logica Universalis 17 (4):511-528.
    Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  42. 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   Download  
     
    Export citation  
     
    Bookmark  
  43. Mutual translatability, equivalence, and the structure of theories.Thomas William Barrett & Hans Halvorson - 2022 - Synthese 200 (3):1-36.
    This paper presents a simple pair of first-order theories that are not definitionally (nor Morita) equivalent, yet are mutually conservatively translatable and mutually 'surjectively' translatable. We use these results to clarify the overall geography of standards of equivalence and to show that the structural commitments that theories make behave in a more subtle manner than has been recognized.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  44. Structural Relativity and Informal Rigour.Neil Barton - 2022 - In Gianluigi Oliveri, Claudio Ternullo & Stefano Boscolo (eds.), Objects, Structures, and Logics, FilMat Studies in the Philosophy of Mathematics. Springer. pp. 133-174.
    Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  45. On Representations of Intended Structures in Foundational Theories.Neil Barton, Moritz Müller & Mihai Prunescu - 2022 - Journal of Philosophical Logic 51 (2):283-296.
    Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. And now for something completely different: the Elementary Process Theory. Revised, updated and extended 2nd edition of the dissertation with almost the same title.Marcoen J. T. F. Cabbolet - 2022 - Utrecht: Eburon Academic Publishers.
    On the one hand, theories of modern physics are very successful in their areas of application. But on the other hand, the irreconcilability of General Relativity (GR) and Quantum Electrodynamics (QED) suggests that these theories of modern physics are not the final answer regarding the fundamental workings of the universe. This monograph takes the position that the key to advances in the foundations of physics lies in the hypothesis that massive systems made up of antimatter are repulsed by the gravitational (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  47. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Weakly Free Multialgebras.Marcelo E. Coniglio & Guilherme V. Toledo - 2022 - Bulletin of the Section of Logic 51 (1):109-141.
    In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  49. Lógica Matemática y el Método de Polya para resolver problemas matemáticos.Franklin Galindo - 2022 - Dissertation,
    La siguiente ponencia-taller tiene por finalidad explicar cómo podría aplicarse el Método de George Polya para resolver problemas (matemáticos) en el contexto de la Lógica Matemática, especialmente en la lógica Matemática elemental (la lógica de primer orden con identidad). Es una propuesta pedagógica experimental (además de las ya existentes) que tal vez pueda ser útil para la enseñanza de la lógica matemática en ciencias o en humanidades. Dicha ponencia se presentó (vía web) con motivo de la celebración del Día Mundial (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  50. Cut-conditions on sets of multiple-alternative inferences.Harold T. Hodes - 2022 - Mathematical Logic Quarterly 68 (1):95 - 106.
    I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between various (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 183