Logic and Philosophy of Logic

Edited by Aleksandra Samonek (Université Catholique de Louvain, Jagiellonian University)
Assistant editors: Nemi Boris Pelgrom, Sadegh Balal Niaki, Mackenzie Marcotte
163 found
Order:
1 — 50 / 163
  1. added 2022-10-05
    Partition Genericity and Pigeonhole Basis Theorems.Benoit Monin & Ludovic Patey - forthcoming - Journal of Symbolic Logic:1-36.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. added 2022-10-05
    Classification of One Dimensional Dynamical Systems by Countable Structures.Henk Bruin & Benjamin Vejnar - forthcoming - Journal of Symbolic Logic:1-21.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. added 2022-10-05
    On Robust Theorems Due to Bolzano, Weierstrass, Jordan, and Cantor.Dag Normann & Sam Sanders - forthcoming - Journal of Symbolic Logic:1-47.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. added 2022-10-05
    Partition Forcing and Independent Families.Jorge A. Cruz-Chapital, Vera Fischer, Osvaldo Guzmán & Jaroslav Šupina - forthcoming - Journal of Symbolic Logic:1-23.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. added 2022-10-04
    The Metalogic of Ground: Pure and Iterative Systems.Michael Bevan - forthcoming - Journal of Philosophical Logic:1-33.
    I develop a graph-theoretic model theory for pure and iterative grounding logics.
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. added 2022-10-04
    A Compendium of Paradoxes. [REVIEW]William D’Alessandro - 2022 - Metascience 31 (3):1-4.
  7. added 2022-10-03
    Modal Homotopy Type Theory. The Prospect of a New Logic for Philosophy.A. Klev & C. Zwanziger - forthcoming - History and Philosophy of Logic:1-6.
    The theory referred to by the—perhaps intimidating—main title of this book is an extension of Per Martin-Löf's dependent type theory. Much philosophical work pertaining to dependent type theory tak...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  8. added 2022-10-03
    Knowledge-of-Own-Factivity, the Definition of Surprise, and a Solution to the Surprise Examination Paradox.Alessandro Aldini, Samuel Allen Alexander & Pierluigi Graziani - forthcoming - CIFMA 2022.
    Fitch's Paradox and the Paradox of the Knower both make use of the Factivity Principle. The latter also makes use of a second principle, namely the Knowledge-of-Factivity Principle. Both the principle of factivity and the knowledge thereof have been the subject of various discussions, often in conjunction with a third principle known as Closure. In this paper, we examine the well-known Surprise Examination paradox considering both the principles on which this paradox rests and some formal characterisations of the surprise notion, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. added 2022-10-01
    Reasoning About Manipulation in Multi-Agent Systems.Christopher Leturc & Grégory Bonnet - forthcoming - Journal of Applied Non-Classical Logics:1-67.
    Selfish, dishonest or malicious agents may find an interest in manipulating others. While many works deal with designing robust systems or manipulative strategies, few works are interested in defin...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  10. added 2022-09-30
    Finitist Axiomatic Truth.Sato Kentaro & Jan Walker - forthcoming - Journal of Symbolic Logic:1-50.
  11. added 2022-09-30
    The Dismissal of ‘Substance’ and ‘Being’ in Peirce’s Regenerated Logic.Maria Regina Brioschi - forthcoming - Logic and Logical Philosophy.
    After introducing the debate between substance philosophy and process philosophy, and clarifying the relevance of the category of ‘substance’ in Peirce’s thought, the present paper reconstructs the role of ‘substance’ and ‘being’ from Peirce’s early works to his theory of the proposition, provided after his studies on the logic of relatives. If those two categories apparently disappear in Peirce’s writings from the mid-1890s onwards, the account of ‘subject’ and ‘copula’ in Peirce’s analysis of the proposition allows one to grasp the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. added 2022-09-30
    Logic, Spatial Algorithms and Visual Reasoning.Andrew Schumann & Jens Lemanski - forthcoming - Logica Universalis:1-9.
    Spatial and diagrammatic reasoning is a significant part not only of logical abilities, but also of logical studies. The authors of this paper consider some novel trends in studying this type of reasoning. They show that there are the following two main trends in spatial logic: logical studies of the distribution of various objects in space ; logical studies of the space algorithms applied by nature itself.
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  13. added 2022-09-30
    Discrete Duality for Nelson Algebras with Tense Operators.Aldo V. Figallo, Gustavo Pelaitay & Jonathan Sarmiento - forthcoming - Studia Logica:1-19.
    In this paper, we continue with the study of tense operators on Nelson algebras :285–312, 2021, Studia Logica 110:241–263, 2022). We define the variety of algebras, which we call tense Nelson D-algebras, as a natural extension of tense De Morgan algebras :255–267, 2014). In particular, we give a discrete duality for these algebras. To do this, we will extend the representation theorems for Nelson algebras given in Sendlewski :257–280, 1984) to the tense case.
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. added 2022-09-30
    Ramsey's Lost Counterfactual.Caterina Sisti - forthcoming - History and Philosophy of Logic:1-16.
    In contemporary works on conditionals, the Ramsey test is a procedure for the evaluation of conditional sentences. There are several versions of the test, all inspired by a footnote by the British...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15. added 2022-09-30
    From Inconsistency to Incompatibility.Marcelo E. Coniglio & Guilherme V. Toledo - forthcoming - Logic and Logical Philosophy:1-36.
    The aim of this article is to generalize logics of formal inconsistency to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible formulas to hold trivializes a deduction, and as a special case, a formula becomes consistent when it is incompatible with its own negation. We show how this notion extends that of consistency in a non-trivial way, presenting conservative translations for many simple LFIs into some of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. added 2022-09-30
    Intuitionistic Propositional Logic with Galois Negations.Minghui Ma & Guiying Li - forthcoming - Studia Logica:1-36.
    Intuitionistic propositional logic with Galois negations ) is introduced. Heyting algebras with Galois negations are obtained from Heyting algebras by adding the Galois pair \\) and dual Galois pair \\) of negations. Discrete duality between GN-frames and algebras as well as the relational semantics for \ are developed. A Hilbert-style axiomatic system \ is given for \, and Galois negation logics are defined as extensions of \. We give the bi-tense logic \ which is obtained from the minimal tense extension (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. added 2022-09-30
    Some Stable Non-Elementary Classes of Modules.Marcos Mazari-Armida - forthcoming - Journal of Symbolic Logic:1-25.
    Fisher [10] and Baur [6] showed independently in the seventies that if T is a complete first-order theory extending the theory of modules, then the class of models of T with pure embeddings is stable. In [25, 2.12], it is asked if the same is true for any abstract elementary class $$ such that K is a class of modules and $\leq _p$ is the pure submodule relation. In this paper we give some instances where this is true: Theorem. Assume (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. added 2022-09-30
    Lvov-Warsaw School. Past and Present Logic.K. Gan-Krzywoszyńska & P. Leśniewski - forthcoming - History and Philosophy of Logic:1-7.
    First, a short anecdote. In the mid-1980s, Professor Jerzy Pogonowski gave a series of lectures entitled The Lvov-Warsaw School at the Institute of Philosophy at the Adam Mickiewicz University in P...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  19. added 2022-09-30
    Three-Dimensional Affine Spatial Logics.Adam Trybus - forthcoming - Logica Universalis:1-18.
    We focus on a branch of region-based spatial logics dealing with affine geometry. The research on this topic is scarce: only a handful of papers investigate such systems, mostly in the case of the real plane. Our long-term goal is to analyse certain family of affine logics with inclusion and convexity as primitives interpreted over real spaces of increasing dimensionality. In this article we show that logics of different dimensionalities must have different theories, thus justifying further work on different dimensions. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20. added 2022-09-30
    Model-Theoretic Properties of Dynamics on the Cantor Set.Christopher J. Eagle & Alan Getz - 2022 - Notre Dame Journal of Formal Logic 63 (3).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. added 2022-09-30
    Poly-Connexivity: Connexive Conjunction and Disjunction.Nissim Francez - 2022 - Notre Dame Journal of Formal Logic 63 (3).
  22. added 2022-09-30
    On Stable Quotients.Krzysztof Krupiński & Adrián Portillo - 2022 - Notre Dame Journal of Formal Logic 63 (3).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. added 2022-09-30
    Characterizing Counterfactuals and Dependencies Over (Generalized) Causal Teams.Fausto Barbero & Fan Yang - 2022 - Notre Dame Journal of Formal Logic 63 (3).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24. added 2022-09-30
    First-Order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier Depth.Rob Egrot & Robin Hirsch - 2022 - Journal of Symbolic Logic 87 (3):1283-1300.
    Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. added 2022-09-30
    Measuring Inconsistency in Some Logics with Tense Operators.John Grant - 2022 - Notre Dame Journal of Formal Logic 63 (3).
  26. added 2022-09-30
    New Relations and Separations of Conjectures About Incompleteness in the Finite Domain.Erfan Khaniki - 2022 - Journal of Symbolic Logic 87 (3):912-937.
    In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as $\mathsf {P}\neq \mathsf {NP}$ [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of this kind had been (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. added 2022-09-30
    Meager-Additive Sets in Topological Groups.Ondřej Zindulka - 2022 - Journal of Symbolic Logic 87 (3):1046-1064.
    By the Galvin–Mycielski–Solovay theorem, a subset X of the line has Borel’s strong measure zero if and only if $M+X\neq \mathbb {R}$ for each meager set M.A set $X\subseteq \mathbb {R}$ is meager-additive if $M+X$ is meager for each meager set M. Recently a theorem on meager-additive sets that perfectly parallels the Galvin–Mycielski–Solovay theorem was proven: A set $X\subseteq \mathbb {R}$ is meager-additive if and only if it has sharp measure zero, a notion akin to strong measure zero.We investigate the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28. added 2022-09-30
    Copying One of a Pair of Structures.Rachael Alvir, Hannah Burchfield & Julia F. Knight - 2022 - Journal of Symbolic Logic 87 (3):1201-1214.
    We ask when, for a pair of structures $\mathcal {A}_1,\mathcal {A}_2$, there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of $\mathcal {A}_1$. We give some conditions guaranteeing that there is such a procedure. The conditions might suggest that for the pair of orderings $\mathcal {A}_1$ of type $\omega _1^{CK}$ and $\mathcal {A}_2$ of Harrison type, there should not be any such procedure, but, in fact, there is one. We construct an (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. added 2022-09-30
    Structural Completeness in Many-Valued Logics with Rational Constants.Joan Gispert, Zuzana Haniková, Tommaso Moraschini & Michał Stronkowski - 2022 - Notre Dame Journal of Formal Logic 63 (3).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. added 2022-09-30
    Enumerating Teams in First-Order Team Logics.Anselm Haak, Arne Meier, Fabian Müller & Heribert Vollmer - 2022 - Annals of Pure and Applied Logic 173 (10):103163.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. added 2022-09-29
    Sou Uma Rede de Narrativas: Aproximações Entre Paul Ricoeur E Alice Munro.Jerzy A. Brzozowski, Ivone Maria Mendes Silva & Janessa Pagnussat - 2022 - Trans/Form/Ação 45 (4):93-116.
    RESUMO: Neste artigo, pretendemos abordar o papel da memória e da narrativa na constituição da identidade pessoal, a partir de conceitos teóricos da obra de Paul Ricoeur e da análise do conto “O urso atravessou a montanha”, de Alice Munro. Esse movimento nos permitirá sublinhar a ideia de que, contrariamente ao que parte da literatura sobre identidade e narrativa tem sustentado, não é só aquilo que poderíamos chamar de autonarrativa que cumpre um papel na manutenção da identidade pessoal. Ao invés (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32. added 2022-09-29
    On VC-Density in VC-Minimal Theories.Vincent Guingona - 2022 - Notre Dame Journal of Formal Logic 63 (3).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. added 2022-09-27
    Inferential Constants.Camillo Fiore, Federico Pailos & Mariela Rubin - forthcoming - Journal of Philosophical Logic: 1 - 26.
    A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  34. added 2022-09-25
    Another Neighbourhood Semantics for Intuitionistic Logic.Morteza Moniri & Fatemeh Shirmohammadzadeh Maleki - forthcoming - Logic Journal of the IGPL.
    In this paper we first introduce a new neighbourhood semantics for propositional intuitionistic logic. We then naturally extend this semantics to first-order intuitionistic logic. We also study bisimulation between neighbourhood models and prove some of their basic properties for both propositional and first-order intuitionistic logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. added 2022-09-25
    Continuous Accessibility Modal Logics.Caleb Camrud & Ranpal Dosanjh - forthcoming - Journal of Philosophical Logic:1-46.
    In classical modal semantics, a binary accessibility relation connects worlds. In this paper, we present a uniform and systematic treatment of modal semantics with a continuous accessibility relation alongside the continuous accessibility modal logics that they model. We develop several such logics for a variety of philosophical applications. Our main conclusions are as follows. Modal logics with a continuous accessibility relation are sound and complete in their natural classes of models. The class of Kripke frames where a continuous accessibility relation (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  36. added 2022-09-23
    ‘Or Both’: A Note on the Alleged Exclusivity of Disjunction in English.Kaave Lajevardi - forthcoming - Analysis.
    I make a point concerning the construction ‘A or B or both’ in English, to the effect that if the connective ‘or’ is understood exclusively across the board then this familiar construction cannot convey the intended inclusive sense of disjunction. If we take ‘or’ inclusively, ‘A or B or both’ has the function of emphasizing that the disjunction is inclusive; taking ‘or’ exclusively, it does nothing.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. added 2022-09-23
    MASS SURVEILLANCE, BEHAVIOURAL CONTROL, AND PSYCHOLOGICAL COERCION THE MORAL ETHICAL RISKS IN COMMERCIAL DEVICES.Yang Immanuel Pachankis - 2022 - In David C. Wyld & Dhinaharan Nagamalai (eds.), Computer Science and Information Technology. Chennai, India: pp. 151-168.
    The research observed, in parallel and comparatively, a surveillance state’s use of communication & cyber networks with satellite applications for power political & realpolitik purposes, in contrast to the outer space security & legit scientific purpose driven cybernetics. The research adopted a psychoanalytic & psychosocial method of observation in the organizational behaviors of the surveillance state, and a theoretical physics, astrochemical, & cosmological feedback method in the contrast group of cybernetics. Military sociology and multilateral movements were adopted in the diagnostic (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  38. added 2022-09-21
    Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - forthcoming - Journal of Logic, Language and Information:1-27.
    The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method of correspondence analysis. To be more detailed, in this paper the latter is adapted to Weir’s non-transitive trivalent logic \. As a result, for each binary extension of \, we present a sound and complete Lemmon-style natural deduction system. Last, but not least, we stress the fact that Avron and his co-authors’ general method of obtaining n-sequent proof systems for any n-valent logic (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39. added 2022-09-20
    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   Direct download  
     
    Export citation  
     
    Bookmark  
  40. added 2022-09-19
    The Architecture of Context and Context-Sensitivity.Tadeusz Ciecierski & Pawel Grabarczyk (eds.) - 2020 - Springer.
  41. added 2022-09-18
    El Axioma de elección en el quehacer matemático contemporáneo.Franklin Galindo & Randy Alzate - 2022 - Aitías 2 (3):49-126.
    Para matemáticos interesados en problemas de fundamentos, lógico-matemáticos y filósofos de la matemática, el axioma de elección es centro obligado de reflexión, pues ha sido considerado esencial en el debate dentro de las posiciones consideradas clásicas en filosofía de la matemática (intuicionismo, formalismo, logicismo, platonismo), pero también ha tenido una presencia fundamental para el desarrollo de la matemática y metamatemática contemporánea. Desde una posición que privilegia el quehacer matemático, nos proponemos mostrar los aportes que ha tenido el axioma en varias (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  42. added 2022-09-17
    The Modal Logic of Potential Infinity: Branching Versus Convergent Possibilities.Ethan Brauer - 2022 - Erkenntnis 87 (5):2161-2179.
    Modal logic provides an elegant way to understand the notion of potential infinity. This raises the question of what the right modal logic is for reasoning about potential infinity. In this article I identify a choice point in determining the right modal logic: Can a potentially infinite collection ever be expanded in two mutually incompatible ways? If not, then the possible expansions are convergent; if so, then the possible expansions are branching. When possible expansions are convergent, the right modal logic (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43. added 2022-09-15
    Deflationism as Alethic Fictionalism Via a SPIF Account of Truth-Talk.Bradley Armour-Garb & James Woodbridge - 2021 - In Michael P. Lynch, J. Wyatt, N. Kellen & J. Kim (eds.), The Nature of Truth: Classic and Contemporary Perspectives, 2nd Edition. Cambridge, MA, USA: pp. 429-453.
    The aim of this chapter is to explain, motivate, and provide the central details of a specific version of what has come to be called alethic fictionalism—namely, a fictionalist account of truth (or, more accurately, of truth-talk, that fragment of discourse that involves the truth-predicate and other alethic-locutions). Our particular brand of alethic fictionalism is sometimes described as a “pretense theory of truth,” and a catchphrase for our view is “truth is a pretense.” But a more precise label for the (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  44. added 2022-09-14
    Searching for Deep Disagreement in Logic: The Case of Dialetheism.Ben Martin - 2021 - Topoi 40 (5):1127-1138.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. added 2022-09-13
    Modality and Validity in the Logic of John Buridan.Boaz Faraday Schuman - 2021 - Dissertation, University of Toronto
    What makes a valid argument valid? Generally speaking, in a valid argument, if the premisses are true, then the conclusion must necessarily also be true. But on its own, this doesn’t tell us all that much. What is truth? And what is necessity? In what follows, I consider answers to these questions proposed by the fourteenth century logician John Buridan († ca. 1358). My central claim is that Buridan’s logic is downstream from his metaphysics. Accordingly, I treat his metaphysical discussions (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  46. added 2022-09-12
    Two Sciences, Two Logics? Can or Should Politics and Ideology Provide Logical Evidence?Luis Felipe Bartolo Alegre - manuscript
    This paper discusses the question of whether politics and ideology could ever be considered sensible sources for logical evidence. After discussing some proposals for this possibility, I answer negatively by arguing that any attempt to deviate from classical logics on these grounds would consist of an ad hoc denial of a logic principle.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  47. added 2022-09-12
    Multiple Generality in Scholastic Logic.Boaz Faraday Schuman - forthcoming - Oxford Studies in Medieval Philosophy.
    Multiple generality has long been known to cause confusion. For example, “Everyone has a donkey that is running” has two readings: either (i) there is a donkey, owned by everyone, and it is running; or (ii) everyone owns some donkey or other, and all such donkeys run. Medieval logicians were acutely aware of such ambiguities, and the logical problems they pose, and sought to sort them out. One of the most ambitious undertakings in this regard is a pair of massive (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  48. added 2022-09-10
    Null Sets and Combinatorial Covering Properties.Piotr Szewczak & Tomasz Weiss - 2022 - Journal of Symbolic Logic 87 (3):1231-1242.
    A subset of the Cantor cube is null-additive if its algebraic sum with any null set is null. We construct a set of cardinality continuum such that: all continuous images of the set into the Cantor cube are null-additive, it contains a homeomorphic copy of a set that is not null-additive, and it has the property $\unicode{x3b3} $, a strong combinatorial covering property. We also construct a nontrivial subset of the Cantor cube with the property $\unicode{x3b3} $ that is not (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49. added 2022-09-10
    Ways of Destruction.Barnabás Farkas & Lyubomyr Zdomskyy - 2022 - Journal of Symbolic Logic 87 (3):938-966.
    We study the following natural strong variant of destroying Borel ideals: $\mathbb {P}$ $+$ -destroys $\mathcal {I}$ if $\mathbb {P}$ adds an $\mathcal {I}$ -positive set which has finite intersection with every $A\in \mathcal {I}\cap V$. Also, we discuss the associated variants $$ \begin{align*} \mathrm{non}^*=&\min\big\{|\mathcal{Y}|:\mathcal{Y}\subseteq\mathcal{I}^+,\; \forall\;A\in\mathcal{I}\;\exists\;Y\in\mathcal{Y}\;|A\cap Y| \omega $ ; we characterise when the Laver–Prikry, $\mathbb {L}$ -generic real $+$ -destroys $\mathcal {I}$, and in the case of P-ideals, when exactly $\mathbb {L}$ $+$ -destroys $\mathcal {I}$ ; and we briefly (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. added 2022-09-10
    Most Simple Extensions of Are Undecidable.Nikolaos Galatos & Gavin St John - 2022 - Journal of Symbolic Logic 87 (3):1156-1200.
    All known structural extensions of the substructural logic $\textbf{FL}_{\textbf{e}}$, the Full Lambek calculus with exchange/commutativity, have decidable theoremhood; in particular all the ones defined by knotted axioms enjoy strong decidability properties. We provide infinitely many such extensions that have undecidable theoremhood, by encoding machines with undecidable halting problem. An even bigger class of extensions is shown to have undecidable deducibility problem ; actually with very few exceptions, such as the knotted axioms and the other prespinal axioms, we prove that undecidability (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 163