Results for 'algorithms whose existence is provable in ZFC'

1000+ found
Order:
  1.  12
    k-Provability in $$\hbox {PA}$$ PA.Paulo Guilherme Santos & Reinhard Kahle - 2021 - Logica Universalis 15 (4):477-516.
    We study the decidability of k-provability in \—the relation ‘being provable in \ with at most k steps’—and the decidability of the proof-skeleton problem—the problem of deciding if a given formula has a proof that has a given skeleton. The decidability of k-provability for the usual Hilbert-style formalisation of \ is still an open problem, but it is known that the proof-skeleton problem is undecidable for that theory. Using new methods, we present a characterisation of some numbers k for (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  3
    Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
    We prove that every computably enumerable random real is provable in Peano Arithmetic to be c.e. random. A major step in the proof is to show that the theorem stating that “a real is c.e. and random iff it is the halting probability of a universal prefix-free Turing machine” can be proven in PA. Our proof, which is simpler than the standard one, can also be used for the original theorem. Our positive result can be contrasted with the case (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  18
    Contributions to the Theory of Large Cardinals through the Method of Forcing.Alejandro Poveda - 2021 - Bulletin of Symbolic Logic 27 (2):221-222.
    The dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.We commence Part I by investigating the Identity Crisis phenomenon in the region comprised (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  31
    Rosser Provability and Normal Modal Logics.Taishi Kurahashi - 2020 - Studia Logica 108 (3):597-617.
    In this paper, we investigate Rosser provability predicates whose provability logics are normal modal logics. First, we prove that there exists a Rosser provability predicate whose provability logic is exactly the normal modal logic \. Secondly, we introduce a new normal modal logic \ which is a proper extension of \, and prove that there exists a Rosser provability predicate whose provability logic includes \.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Neutrosophic Association Rule Mining Algorithm for Big Data Analysis.Mohamed Abdel-Basset, Mai Mohamed, Florentin Smarandache & Victor Chang - 2018 - Symmetry 10 (4):1-19.
    Big Data is a large-sized and complex dataset, which cannot be managed using traditional data processing tools. Mining process of big data is the ability to extract valuable information from these large datasets. Association rule mining is a type of data mining process, which is indented to determine interesting associations between items and to establish a set of association rules whose support is greater than a specific threshold. The classical association rules can only be extracted from binary data where (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  6.  4
    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  
  7.  26
    Which set existence axioms are needed to prove the cauchy/peano theorem for ordinary differential equations?Stephen G. Simpson - 1984 - Journal of Symbolic Logic 49 (3):783-802.
    We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA 0 whose principal axioms are ▵ 0 1 comprehension and Σ 0 1 induction. Our main result is that, over RCA 0 , the Cauchy/Peano Theorem is provably equivalent to weak Konig's lemma, i.e. the statement that every infinite (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   40 citations  
  8.  37
    What is the theory without power set?Victoria Gitman, Joel David Hamkins & Thomas A. Johnstone - 2016 - Mathematical Logic Quarterly 62 (4-5):391-406.
    We show that the theory, consisting of the usual axioms of but with the power set axiom removed—specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every set can be well‐ordered—is weaker than commonly supposed and is inadequate to establish several basic facts often desired in its context. For example, there are models of in which ω1 is singular, in which every set of reals is countable, yet ω1 exists, in which there are sets of (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  9.  31
    Consequences of arithmetic for set theory.Lorenz Halbeisen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):30-40.
    In this paper, we consider certain cardinals in ZF (set theory without AC, the axiom of choice). In ZFC (set theory with AC), given any cardinals C and D, either C ≤ D or D ≤ C. However, in ZF this is no longer so. For a given infinite set A consider $\operatorname{seq}^{1 - 1}(A)$ , the set of all sequences of A without repetition. We compare $|\operatorname{seq}^{1 - 1}(A)|$ , the cardinality of this set, to |P(A)|, the cardinality of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  10.  78
    Proving Induction.Alexander Paseau - 2011 - Australasian Journal of Logic 10:1-17.
    The hard problem of induction is to argue without begging the question that inductive inference, applied properly in the proper circumstances, is conducive to truth. A recent theorem seems to show that the hard problem has a deductive solution. The theorem, provable in ZFC, states that a predictive function M exists with the following property: whatever world we live in, M ncorrectly predicts the world’s present state given its previous states at all times apart from a well-ordered subset. On (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  6
    Almost free groups and long Ehrenfeucht–Fraı̈ssé games.Pauli Väisänen - 2003 - Annals of Pure and Applied Logic 123 (1-3):101-134.
    An Abelian group G is strongly λ -free iff G is L ∞, λ -equivalent to a free Abelian group iff the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ω between G and a free Abelian group. We study possible longer Ehrenfeucht–Fraı̈ssé games between a nonfree group and a free Abelian group. A group G is called ε -game-free if the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ε between G (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12.  7
    Results on Martin’s Conjecture.Patrick Lutz - 2021 - Bulletin of Symbolic Logic 27 (2):219-220.
    Martin’s conjecture is an attempt to classify the behavior of all definable functions on the Turing degrees under strong set theoretic hypotheses. Very roughly it says that every such function is either eventually constant, eventually equal to the identity function or eventually equal to a transfinite iterate of the Turing jump. It is typically divided into two parts: the first part states that every function is either eventually constant or eventually above the identity function and the second part states that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  39
    Harrington’s principle in higher order arithmetic.Yong Cheng & Ralf Schindler - 2015 - Journal of Symbolic Logic 80 (2):477-489.
    LetZ2,Z3, andZ4denote 2nd, 3rd, and 4thorder arithmetic, respectively. We let Harrington’s Principle, HP, denote the statement that there is a realxsuch that everyx-admissible ordinal is a cardinal inL. The known proofs of Harrington’s theorem “$Det\left$implies 0♯exists” are done in two steps: first show that$Det\left$implies HP, and then show that HP implies 0♯exists. The first step is provable inZ2. In this paper we show thatZ2+ HP is equiconsistent with ZFC and thatZ3+ HP is equiconsistent with ZFC + there exists a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  6
    Logical equations and admissible rules of inference with parameters in modal provability logics.V. V. Rybakov - 1990 - Studia Logica 49 (2):215 - 239.
    This paper concerns modal logics of provability — Gödel-Löb systemGL and Solovay logicS — the smallest and the greatest representation of arithmetical theories in propositional logic respectively. We prove that the decision problem for admissibility of rules (with or without parameters) inGL andS is decidable. Then we get a positive solution to Friedman''s problem forGL andS. We also show that A. V. Kuznetsov''s problem of the existence of finite basis for admissible rules forGL andS has a negative solution. Afterwards (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  15.  11
    Some Observations on the FGH Theorem.Taishi Kurahashi - 2023 - Studia Logica 111 (5):749-778.
    We investigate the Friedman–Goldfarb–Harrington theorem from two perspectives. Firstly, in the frameworks of classical and modal propositional logics, we study the forms of sentences whose existence is guaranteed by the FGH theorem. Secondly, we prove some variations of the FGH theorem with respect to Rosser provability predicates.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  18
    Filling cages. Reverse mathematics and combinatorial principles.Marta Fiori Carones - 2020 - Bulletin of Symbolic Logic 26 (3-4):300-300.
    In the thesis some combinatorial statements are analysed from the reverse mathematics point of view. Reverse mathematics is a research program, which dates back to the Seventies, interested in finding the exact strength, measured in terms of set-existence axioms, of theorems from ordinary non set-theoretic mathematics. After a brief introduction to the subject, an on-line (incremental) algorithm to transitively reorient infinite pseudo-transitive oriented graphs is defined. This implies that a theorem of Ghouila-Houri is provable in RCA_0 and hence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  18
    Is the Universe a Vast, Consciousness-created Virtual Reality Simulation?Bernard Haisch - 2014 - Cosmos and History 10 (1):48-60.
    Two luminaries of 20th century astrophysics were Sir James Jeans and Sir Arthur Eddington. Both took seriously the view that there is more to reality than the physical universe and more to consciousness than simply brain activity. In his Science and the Unseen World Eddington speculated about a spiritual world and that "conscious is not wholly, nor even primarily a device for receiving sense impressions." Jeans also speculated on the existence of a universal mind and a non-mechanical reality, writing (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  18
    Generation of Referring Expressions: Assessing the Incremental Algorithm.Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power - 2012 - Cognitive Science 36 (5):799-836.
    A substantial amount of recent work in natural language generation has focused on the generation of ‘‘one-shot’’ referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expressions from human subjects and computing the similarity between the expressions elicited and the ones generated by algorithms. It turns (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  19.  48
    A Novel Edge Detection Algorithm Based on Texture Feature Coding.Ömer Faruk Alcin, Mehmet Ustundag, Yanhui Guo & Abdulkadir Sengur - 2015 - Journal of Intelligent Systems 24 (2):235-248.
    A new edge detection technique based on the texture feature coding method is proposed. The TFCM is a texture analysis scheme that is generally used in texture-based image segmentation and classification applications. The TFCM transforms an input image into a texture feature image whose pixel values represent the texture information of the pixel in the original image. Then, on the basis of the transformed image, several features are calculated as texture descriptors. In this article, the TFCM is employed differently (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  5
    Classification of non‐well‐founded sets and an application.Nitta Takashi, Okada Tomoko & Athanassios Tzouvaras - 2003 - Mathematical Logic Quarterly 49 (2):187-200.
    A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti-well-founded sets, i. e., non-well-founded sets whose all maximal ∈-paths are circular, are studied. For example they form transitive inner models of ZFC minus foundation and empty set, and they include uncountably many hereditarily finite awf sets. A complete list of Finsler and Boffa awf sets (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  32
    Whose Existence? A Compromise to the Fregean Neo-Meinongian Divide.Giuliano Bacigalupo - 2016 - Argumenta 2 (1):5-24.
    The dispute between the Fregean and the Neo-Meinongian approach to existence has become entrenched: it seems that nothing but intuitions may be relied upon to decide the issue. And since contemporary analytic philosophers clearly are inclined towards the intuitions that support Frege's approach, it looks as if Fregeanism has won the day. In this paper, however, I try to develop a compromise solution. This compromise consists in abandoning the assumption shared by both Fregeanism and Neo-Meinongianism, namely that the notion (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  9
    Whose Body Is It? Technolegal Materialization of Victims’ Bodies and Remains after the World Trade Center Terrorist Attacks.Victor Toom - 2016 - Science, Technology, and Human Values 41 (4):686-708.
    This article empirically analyzes how victims’ remains were recovered, identified, repatriated, and retained after the World Trade Center terrorist attacks of September 11, 2001. It does so by asking the question whose body is it. This question brings to the fore issues related to personhood and ownership: how are anonymous and unrecognizable bodily remains given back an identity; and who has ownership of or custody over identified and unidentified human remains? It is in this respect that the article engages (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  15
    Immersive practices in the modern cultural space(world and domestic experience).Anastasiia Nikiforova & Natlia Voronova - forthcoming - Philosophy and Culture (Russian Journal).
    The subject of this research is the immersive artistic environments that exist in the modern cultural space. Immersive technologies are used today in educational processes, historical reconstruction, various forms of socialization, in visual arts; immersion is implemented as a special scientific approach in anthropological, ethnographic, art history studies. Interactivity and immersiveness are considered here as complex predictable processes whose algorithms are embedded in the very basis of an artistic work or cultural environment. They make it possible to intensify (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  7
    Generation of Referring Expressions: Assessing the Incremental Algorithm.Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power - 2012 - Cognitive Science 36 (5):799-836.
    A substantial amount of recent work in natural language generation has focused on the generation of ‘‘one‐shot’’ referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expressions from human subjects and computing the similarity between the expressions elicited and the ones generated by algorithms. It turns (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  25.  15
    Atypical employment and disability in the digital economy: accountability gap leaves disabled app developers’ rights unprotected.Jenny Krutzinna & Luciano Floridi - 2018 - Law, Innovation and Technology 10 (2):185-196.
    Although the employment situation of disabled people has widely been identified as in need of improvement, progress in this area remains slow. While some progress has been made in including the physically or sensory disabled in the workplace, other types of disability have been largely neglected. This applies particularly to disabled workers in atypical employment, such as those whose workplace is the Digital Economy. In this article, we discuss the case of disabled app developers as a significant example of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  6
    Localizing the axioms.Athanassios Tzouvaras - 2010 - Archive for Mathematical Logic 49 (5):571-601.
    We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27. Whose Problem Is Non-Identity?Paul Hurley & Rivka Weinberg - 2014 - Journal of Moral Philosophy 12 (6):699-730.
    Teleological theories of reason and value, upon which all reasons are fundamentally reasons to realize states of affairs that are in some respect best, cannot account for the intuition that victims in non-identity cases have been wronged. Many philosophers, however, reject such theories in favor of alternatives that recognize fundamentally non-teleological reasons, second-personal reasons that reflect a moral significance each person has that is not grounded in the teleologist’s appeal to outcomes. Such deontological accounts appear to be better positioned to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28.  22
    Ns Saturated and -Definable.Stefan Hoffelner - 2021 - Journal of Symbolic Logic 86 (1):25-59.
    We show that under the assumption of the existence of the canonical inner model with one Woodin cardinal$M_1$, there is a model of$\mathsf {ZFC}$in which$\mbox {NS}_{\omega _{1}}$is$\aleph _2$-saturated and${\Delta }_{1}$-definable with$\omega _1$as a parameter which answers a question of S. D. Friedman and L. Wu. We also show that starting from an arbitrary universe with a Woodin cardinal, there is a model with$\mbox {NS}_{\omega _{1}}$saturated and${\Delta }_{1}$-definable with a ladder system$\vec {C}$and a full Suslin treeTas parameters. Both results rely (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  7
    Whose Dance Is It Anyway?: Property, Copyright and the Commons.Kriss Ravetto-Biagioli - 2021 - Theory, Culture and Society 38 (1):101-126.
    Until recently, dance was not considered to warrant copyright protection because it existed only as a live performance that was not fixed in a ‘tangible medium of expression’. Not being an object, it could not be property. But the more we try to fold dance into existing modes of copyright and conventional notions of property, the more it resists, upsetting the core assumptions of Locke's social contract theory. Legal scholars argue that the expansion of copyright protection shrinks the public domain. (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Underestimating the World.Daniel Stoljar - forthcoming - Journal of Consciousness Studies.
    Galen Strawson has contrasting attitudes to consciousness and free will. In the case of the former, he says it is a fundamental element of nature whose denial is the “greatest woo-woo of the human mind.” In the case of the latter, by contrast, he says it is not merely non-existent but “provably impossible.” Why the difference? This paper suggests this distinctive pattern of positions is generated by underestimating the world (to adapt a phrase Strawson uses himself in another context). (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  31.  27
    Whose Fault Is It?Bengt Brülde, U. Martin Persson, Lina Eriksson & Fredrik Hedenus - 2023 - Environmental Ethics 45 (2):103-129.
    Many of the major challenges facing global society are unstructured collective harms (e.g., global warming): collective in the sense that they arise as the result of the actions of, or interactions among, multiple agents, and unstructured in the sense that there is no coordination or intention to cause harm among these agents. But how should we distribute moral responsibility for these harms? In this paper, an answer is proposed to this question. This answer builds on but develops existing proposals by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  14
    Existing in Discrete States: On the Techno-Aesthetics of Algorithmic Being-in-Time.Wolfgang Ernst - 2021 - Theory, Culture and Society 38 (7-8):13-31.
    Against a remarkable hardware oblivion in discussions of algorithmic intelligence, this article insists that algorithmic thought, or abstract computation, cannot be separated from its technological implementation. It requires a material medium for an abstract mechanism to become a procedural event. Temporality is both the condition and the limiting (and irritating) factor in the computational function. ‘Radical’ media archaeology is proposed as a method for such an analysis, and the neologism of techno lógos to describe some aspects of algorithmic reason which (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  20
    A Novel Fuzzy Algorithm to Introduce New Variables in the Drug Supply Decision-Making Process in Medicine.Jose M. Gonzalez-Cava, José Antonio Reboso, José Luis Casteleiro-Roca, José Luis Calvo-Rolle & Juan Albino Méndez Pérez - 2018 - Complexity 2018:1-15.
    One of the main challenges in medicine is to guarantee an appropriate drug supply according to the real needs of patients. Closed-loop strategies have been widely used to develop automatic solutions based on feedback variables. However, when the variable of interest cannot be directly measured or there is a lack of knowledge behind the process, it turns into a difficult issue to solve. In this research, a novel algorithm to approach this problem is presented. The main objective of this study (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  34.  6
    Closed maximality principles: implications, separations and combinations.Gunter Fuchs - 2008 - Journal of Symbolic Logic 73 (1):276-308.
    l investigate versions of the Maximality Principles for the classes of forcings which are <κ-closed. <κ-directed-closed, or of the form Col (κ. <Λ). These principles come in many variants, depending on the parameters which are allowed. I shall write MPΓ(A) for the maximality principle for forcings in Γ, with parameters from A. The main results of this paper are: • The principles have many consequences, such as <κ-closed-generic $\Sigma _{2}^{1}(H_{\kappa})$ absoluteness, and imply. e.g., that ◇κ holds. I give an application (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  35.  9
    Continuum-many Boolean algebras of the form $\mathcal{p}(\omega)/\mathcal{I}, \mathcal{I}$ borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
    We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum $2^{\aleph_{0}}$ ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could be fewer in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  15
    Special ultrafilters and cofinal subsets of $$({}^omega omega, <^*)$$.Peter Nyikos - 2020 - Archive for Mathematical Logic 59 (7-8):1009-1026.
    The interplay between ultrafilters and unbounded subsets of \ with the order \ of strict eventual domination is studied. Among the tools are special kinds of non-principal ultrafilters on \. These include simple P-points; that is, ultrafilters with a base that is well-ordered with respect to the reverse of the order \ of almost inclusion. It is shown that the cofinality of such a base must be either \, the least cardinality of \-unbounded set, or \, the least cardinality of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  27
    More Notions of Forcing Add a Souslin Tree.Ari Meir Brodsky & Assaf Rinot - 2019 - Notre Dame Journal of Formal Logic 60 (3):437-455.
    An ℵ1-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But fifteen years after Tennenbaum and Jech independently devised notions of forcing for introducing such a tree, Shelah proved that already the simplest forcing notion—Cohen forcing—adds an ℵ1-Souslin tree. In this article, we identify a rather large class of notions of forcing that, assuming a GCH-type hypothesis, add a λ+-Souslin tree. This class includes Prikry, Magidor, and Radin forcing.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  16
    Random World and Quantum Mechanics.Jerzy Król, Krzysztof Bielas & Torsten Asselmeyer-Maluga - 2023 - Foundations of Science 28 (2):575-625.
    Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin–Löf. We extend this result and demonstrate that QM is algorithmic $$\omega$$ -random and generic, precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo–Fraenkel Solovay random on (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  7
    Existence of Finite Total Equivalence Systems for Certain Closed Classes of 3-Valued Logic Functions.Ilya Makarov - 2015 - Logica Universalis 9 (1):1-26.
    The article deals with finding finite total equivalence systems for formulas based on an arbitrary closed class of functions of several variables defined on the set {0, 1, 2} and taking values in the set {0,1} with the property that the restrictions of its functions to the set {0, 1} constitutes a closed class of Boolean functions. We consider all classes whose restriction closure is either the set of all functions of two-valued logic or the set T a of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Mad Speculation and Absolute Inhumanism: Lovecraft, Ligotti, and the Weirding of Philosophy.Ben Woodard - 2011 - Continent 1 (1):3-13.
    continent. 1.1 : 3-13. / 0/ – Introduction I want to propose, as a trajectory into the philosophically weird, an absurd theoretical claim and pursue it, or perhaps more accurately, construct it as I point to it, collecting the ground work behind me like the Perpetual Train from China Mieville's Iron Council which puts down track as it moves reclaiming it along the way. The strange trajectory is the following: Kant's critical philosophy and much of continental philosophy which has followed, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  76
    Simple Models in Complex Worlds: Occam’s Razor and Statistical Learning Theory.Falco J. Bargagli Stoffi, Gustavo Cevolani & Giorgio Gnecco - 2022 - Minds and Machines 32 (1):13-42.
    The idea that “simplicity is a sign of truth”, and the related “Occam’s razor” principle, stating that, all other things being equal, simpler models should be preferred to more complex ones, have been long discussed in philosophy and science. We explore these ideas in the context of supervised machine learning, namely the branch of artificial intelligence that studies algorithms which balance simplicity and accuracy in order to effectively learn about the features of the underlying domain. Focusing on statistical learning (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  6
    Continuum-Many Boolean Algebras of the Form [image] Borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
    We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum $2^{\aleph_{0}}$ ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could be fewer in (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43.  19
    The Determinacy of Context-Free Games.Olivier Finkel - 2013 - Journal of Symbolic Logic 78 (4):1115-1134.
    We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by realtime 1-counter Büchi automata is equivalent to the determinacy of analytic Gale-Stewart games which is known to be a large cardinal assumption. We show also that the determinacy of Wadge games between two players in charge ofω-languages accepted by 1-counter Büchi automata is equivalent to the analytic Wadge determinacy. Using some results of set theory we prove that one can effectively construct a 1-counter Büchi automatonand (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  3
    Reflections on art, nature and technology: The role of technology, algorithm, nature, psyche and imagination in the aspiration of an aesthetic experience.Paola Lopreiato - 2014 - Technoetic Arts 12 (2):423-428.
    There is something frustrating in the concept of algorithm that can even worry: its limitations. An algorithm does not need the time to define itself, it possesses in its structure everything that defines it and can work exclusively in a site, such as a computer, which is itself another finite system. Whenever a particular algorithm will be executed it will always be inexorably equal to itself because the number of possible states is finite. A logical­mathematical algorithm is essentially very different (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  45.  10
    Relativized Adjacency.Dakotah Lambert - 2023 - Journal of Logic, Language and Information 32 (4):707-731.
    For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is defined. Algebraic as well as automata-, language-, and model-theoretic characterizations are provided for each of these relativized classes, except in cases where this is provably impossible. These various characterizations are necessarily intertwined due to the well-studied logic-automaton connection and the relationship between finite-state automata and (syntactic) semigroups. Closure properties of each class are demonstrated by using automata-theoretic methods to provide constructive proofs for the closures that do hold (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  8
    Extensions of arithmetic for proving termination of computations.Clement F. Kent & Bernard R. Hodgson - 1989 - Journal of Symbolic Logic 54 (3):779-794.
    Kirby and Paris have exhibited combinatorial algorithms whose computations always terminate, but for which termination is not provable in elementary arithmetic. However, termination of these computations can be proved by adding an axiom first introduced by Goodstein in 1944. Our purpose is to investigate this axiom of Goodstein, and some of its variants, and to show that these are potentially adequate to prove termination of computations of a wide class of algorithms. We prove that many variations (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47.  2
    Increasing use of DNR orders in the elderly worldwide: whose choice is it?E. P. Cherniack - 2002 - Journal of Medical Ethics 28 (5):303-307.
    Most elderly patients die with an order in place that they not be given cardiopulmonary resuscitation . Surveys have shown that many elderly in different parts of the world want to be resuscitated, but may lack knowledge about the specifics of cardiopulmonary resuscitation . Data from countries other than the US is limited, but differences in physician and patient opinions by nationality regarding CPR do exist. Physicians’ own preferences for CPR may predominate in the DNR decision making process for their (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  48.  11
    Lightweight Cryptographic Algorithms for Guessing Attack Protection in Complex Internet of Things Applications.Mohammad Kamrul Hasan, Muhammad Shafiq, Shayla Islam, Bishwajeet Pandey, Yousef A. Baker El-Ebiary, Nazmus Shaker Nafi, R. Ciro Rodriguez & Doris Esenarro Vargas - 2021 - Complexity 2021:1-13.
    As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  13
    Uniqueness of normal proofs of minimal formulas.Makoto Tatsuta - 1993 - Journal of Symbolic Logic 58 (3):789-799.
    A minimal formula is a formula which is minimal in provable formulas with respect to the substitution relation. This paper shows the following: (1) A β-normal proof of a minimal formula of depth 2 is unique in NJ. (2) There exists a minimal formula of depth 3 whose βη-normal proof is not unique in NJ. (3) There exists a minimal formula of depth 3 whose βη-normal proof is not unique in NK.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50. Procedural Semantics and its Relevance to Paradox.Elbert Booij - forthcoming - Logic and Logical Philosophy:1-24.
    Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000