Related categories

25229 found
Order:
1 — 50 / 25229
Material to categorize
  1. Continuous Sentences Preserved Under Reduced Products.Isaac Goldbring & H. Jerome Keisler - 2020 - Journal of Symbolic Logic:1-33.
    Answering a question of Cifú Lopes, we give a syntactic characterization of those continuous sentences that are preserved under reduced products of metric structures. In fact, we settle this question in the wider context of general structures as introduced by the second author.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. Asymptotic Analysis of Skolem’s Exponential Functions.Alessandro Berarducci & Marcello Mamino - 2020 - Journal of Symbolic Logic:1-25.
    Skolem studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function ${\mathbf {x}}$, and such that whenever f and g are in the set, $f+g,fg$ and $f^g$ are in the set. This set of germs is well ordered and Skolem conjectured that its order type is epsilon-zero. Van den Dries and Levitz computed the order type of the fragment below $2^{2^{\mathbf {x}}}$. Here we prove that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. The Tree of Tuples of a Structure.Matthew Harrison-Trainor & Antonio Montalbán - 2022 - Journal of Symbolic Logic 87 (1):21-46.
    Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. Muchnik Degrees and Cardinal Characteristics.Benoit Monin & André Nies - 2021 - Journal of Symbolic Logic 86 (2):471-498.
    A mass problem is a set of functions $\omega \to \omega $. For mass problems ${\mathcal {C}}, {\mathcal {D}}$, one says that ${\mathcal {C}}$ is Muchnik reducible to ${\mathcal {D}}$ if each function in ${\mathcal {C}}$ is computed by a function in ${\mathcal {D}}$. In this paper we study some highness properties of Turing oracles, which we view as mass problems. We compare them with respect to Muchnik reducibility and its uniform strengthening, Medvedev reducibility.For $p \in [0,1]$ let ${\mathcal {D}}$ (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles.Joel David Hamkins & Øystein Linnebo - 2022 - Review of Symbolic Logic 15 (1):1-35.
    We analyze the precise modal commitments of several natural varieties of set-theoretic potentialism, using tools we develop for a general model-theoretic account of potentialism, building on those of Hamkins, Leibman and Löwe [14], including the use of buttons, switches, dials and ratchets. Among the potentialist conceptions we consider are: rank potentialism, Grothendieck–Zermelo potentialism, transitive-set potentialism, forcing potentialism, countable-transitive-model potentialism, countable-model potentialism, and others. In each case, we identify lower bounds for the modal validities, which are generally either S4.2 or S4.3, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  6. De Zolt’s Postulate: An Abstract Approach.Eduardo N. Giovannini, Edward H. Haeusler, Abel Lassalle-Casanave & Paulo A. S. Veloso - 2022 - Review of Symbolic Logic 15 (1):197-224.
    A theory of magnitudes involves criteria for their equivalence, comparison and addition. In this article we examine these aspects from an abstract viewpoint, by focusing on the so-called De Zolt’s postulate in the theory of equivalence of plane polygons. We formulate an abstract version of this postulate and derive it from some selected principles for magnitudes. We also formulate and derive an abstract version of Euclid’s Common Notion 5, and analyze its logical relation to the former proposition. These results prove (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7. UFO: Unified Foundational Ontology.Giancarlo Guizzardi, Alessander Bottes Benevides, Claudemir M. Fonseca, João Paulo A. Almeida, Tiago Prince Sales & Daniele Porello - 2022 - Applied ontology 1 (17):167-210.
    The Unified Foundational Ontology (UFO) was developed over the last two decades by consistently putting together theories from areas such as formal ontology in philosophy, cognitive science, linguistics, and philosophical logics. It comprises a number of micro-theories addressing fundamental conceptual modeling notions, including entity types and relationship types. The aim of this paper is to summarize the current state of UFO, presenting a formalization of the ontology, along with the analysis of a number of cases to illustrate the application of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. The Logica Yearbook 2012.Vit Puncochar & Petr Svarny (eds.) - 2013 - College Publications.
    This volume of the Logica Yearbook series brings together articles presented at the annual international symposium Logica 2012, Hejnice, the Czech Republic. The articles range over mathematical and philosophical logic, history and philosophy of logic, and the analysis of natural language.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Completeness and Doxastic Plurality for Topological Operators of Knowledge and Belief.Thomas Mormann - manuscript
    The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of point-free topology) (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  10. The Subject Matter of Logic: Explaining What Logic is About.Elizabeth Olsen - 2021 - Dissertation, Victoria University of Wellington
    Logicians disagree about how validity—the very heart of logic—should be understood. Many different formal systems have been born due to this disagreement. This thesis examines how teachers explain the subject matter of logic to students in introductory logic textbooks, and demonstrates the different explanations teachers use. These differences help explain why logicians have different intuitions about validity.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Transitivity When the Same Are Distinct.Eric de Araujo - forthcoming - Erkenntnis.
    It is widely assumed that the identity relation is, among other things, transitive. Some have proposed that the identity relation might hold between objects contingently or occasionally. If, on those proposals, identity is shown to not be transitive, then there is reason to reject such proposals. One such argument attempts to show that the identity relation on such proposals violates transitivity in cases of 'simultaneous' fissions and fusion. I argue that, even in those cases, contingent identity and occasional identity are (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12. The Inextricable Link Between Conditionals and Logical Consequence.Matheus Silva - manuscript
    There is a profound, but frequently ignored relationship between the classical notion of logical consequence (formal implication) and material implication. The first repeats the patterns of the latter, but with a wider modal reach. It is argued that this kinship between formal and material implication simply means that they express the same variety of implication, but differ in scope. Formal implication is unrestricted material implication. This apparently innocuous observation has some significant corollaries: (1) conditionals are not connectives, but arguments; (2) (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  13. Iterability for (Transfinite) Stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
    We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let Ω be a regular uncountable cardinal. Let m < ω and M be an m-sound premouse and Σ be...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14. On Wide Aronszajn Trees in the Presence of Ma.Mirna Džamonja & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (1):210-223.
    A wide Aronszajn tree is a tree of size and height $\omega _{1}$ with no uncountable branches. We prove that under $MA$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler and Väänänen from 1994. We also prove that under $MA$, every wide Aronszajn tree weakly embeds in an Aronszajn tree, which combined with a result of Todorčević from 2007, gives that under $MA$ every wide Aronszajn tree embeds into a (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. On the Epistemological Significance of Arguments From Non Transitive Similarity.Friedrich Wilhelm Grafe - 2021 - Archive.Org.
    This paper aims to argue for, else illustrate the epistemological significance of the use of non transitive similarity relations, mapping only to "types", as methodologically being on a par with the use of transitive similarity relations (equivalence relations), mapping as well to "predicates". -/- In this paper the sketch of an exact but simple geometrical model of the above construct is followed by mentioning respective use cases for non transitive similarity relations from science and humanities. A well known metaphysics example (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16. Un alegato a favor del enfoque lógico en la teoría de la argumentación.Marc Jiménez-Rolland - 2020 - Quadripartita Ratio 10:21-35.
    El estudio actual de la argumentación se encuentra distanciado de la lógica. En este artículo sostengo que restaurar el vínculo del estudio de la argumentación con esta disciplina podría resultar benéfico para la metas descriptivas y normativas de este campo de investigación. Tras destacar algunos aspectos del surgimiento la teoría de la argumentación contemporánea, enfatizando la idea de "perspectivas", explico cómo el reconocimiento de sus objetivos y tareas volvió problemática la coexistencia de varios enfoques o aproximaciones para el estudio de (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. Anti-Essentialism, Modal Relativity, and Alternative Material-Origin Counterfactuals.Frederique Janssen-Lauret - 2021 - Synthese 199 (3-4):8379-8398.
    In ordinary language, in the medical sciences, and in the overlap between them, we frequently make claims which imply that we might have had different gametic origins from the ones we actually have. Such statements seem intuitively true and coherent. But they counterfactually ascribe different DNA to their referents and therefore contradict material-origin essentialism, which Kripke and his followers argue is intuitively obvious. In this paper I argue, using examples from ordinary language and from philosophy of medicine and bioethics, that (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18. Gödel Diffeomorphisms.Matthew Foreman - 2020 - Bulletin of Symbolic Logic 26 (3-4):219-223.
    In 1932, von Neumann proposed classifying the statistical behavior of differentiable systems. Joint work of B. Weiss and the author proved that the classification problem is complete analytic. Based on techniques in that proof, one is able to show that the collection of recursive diffeomorphisms of the 2-torus that are isomorphic to their inverses is $\Pi ^0_1$-hard via a computable 1-1 reduction. As a corollary there is a diffeomorphism that is isomorphic to its inverse if and only if the Riemann (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Structural Fixed-Point Theorems.Brian Rabern & Landon Rabern - manuscript
    The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of certain functions, thereby boiling it down to get (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  20. The Fundamental Theorem of Central Element Theory.Mariana Vanesa Badano & Diego Jose Vaggione - 2020 - Journal of Symbolic Logic 85 (4):1599-1606.
    We give a short proof of the fundamental theorem of central element theory. The original proof is constructive and very involved and relies strongly on the fact that the class be a variety. Here we give a more direct nonconstructive proof which applies for the more general case of a first-order class which is both closed under the formation of direct products and direct factors.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. A Metric Version of Schlichting’s Theorem.Itaï Ben Yaacov & Frank O. Wagner - 2020 - Journal of Symbolic Logic 85 (4):1607-1613.
    If ${\mathfrak {F}}$ is a type-definable family of commensurable subsets, subgroups or subvector spaces in a metric structure, then there is an invariant subset, subgroup or subvector space commensurable with ${\mathfrak {F}}$. This in particular applies to type-definable or hyper-definable objects in a classical first-order structure.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22. Dimension Inequality for a Definably Complete Uniformly Locally o-Minimal Structure of the Second Kind.Masato Fujita - 2020 - Journal of Symbolic Logic 85 (4):1654-1663.
    Consider a definably complete uniformly locally o-minimal expansion of the second kind of a densely linearly ordered abelian group. Let $f:X \rightarrow R^n$ be a definable map, where X is a definable set and R is the universe of the structure. We demonstrate the inequality $\dim ) \leq \dim $ in this paper. As a corollary, we get that the set of the points at which f is discontinuous is of dimension smaller than $\dim $. We also show that the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. Multidimensional Exact Classes, Smooth Approximation and Bounded 4-Types.Daniel Wolf - 2020 - Journal of Symbolic Logic 85 (4):1305-1341.
    In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class, a special kind of multidimensional asymptotic class with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result, as conjectured by Macpherson: For any countable language $\mathcal {L}$ and any positive integer d the class $\mathcal {C}$ of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. Думата, нейното значение и нейната близост.Vasil Penchev - 1995 - Philosophical Alternatives 4 (6):105-113.
    Предложен е семантичен подход към логиката, в рамките на какъвто е вид дискурс, отличим със своята тавтологичност. На тази основа е даден пример и сравнение с психоаналитичен (Фройдистки) дискурс.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  25. Homogeneous Structures with Nonuniversal Automorphism Groups.Wiesław Kubiś & Saharon Shelah - 2020 - Journal of Symbolic Logic 85 (2):817-827.
    We present three examples of countable homogeneous structures whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures.Our first example is a particular case of a rather general construction on Fraïssé classes, which we call diversification, leading to automorphism groups containing copies of all finite groups. Our second example is a special case of another general construction on Fraïssé classes, the mixed sums, leading to a Fraïssé class with all finite symmetric (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26. The Ketonen Order.Gabriel Goldberg - 2020 - Journal of Symbolic Logic 85 (2):585-604.
    We study a partial order on countably complete ultrafilters introduced by Ketonen [2] as a generalization of the Mitchell order. The following are our main results: the order is wellfounded; its linearity is equivalent to the Ultrapower Axiom, a principle introduced in the author’s dissertation [1]; finally, assuming the Ultrapower Axiom, the Ketonen order coincides with Lipschitz reducibility in the sense of generalized descriptive set theory.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. Coding in Graphs and Linear Orderings.Julia F. Knight, Alexandra A. Soskova & Stefan V. Vatev - 2020 - Journal of Symbolic Logic 85 (2):673-690.
    There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$, these formulas interpret $\mathcal {A}$ in $\Phi $. It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi $ uniformly; i.e., $\mathcal {A}\leq _s\Phi $ with a fixed Turing operator that serves for all $\mathcal {A}$. We observe that there is a graph G (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Deciding Some Maltsev Conditions in Finite Idempotent Algebras.Alexandr Kazda & Matt Valeriote - 2020 - Journal of Symbolic Logic 85 (2):539-562.
    In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some given n. We show that for such “path defined” Maltsev conditions, the decision problem is polynomial-time solvable.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. The Complexity of Homeomorphism Relations on Some Classes of Compacta.Paweł Krupski & Benjamin Vejnar - 2020 - Journal of Symbolic Logic 85 (2):733-748.
    We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism relation between regular continua is classifiable by countable structures and hence it is Borel bireducible with the universal orbit equivalence relation of the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. A Descriptive Main Gap Theorem.Francesco Mangraviti & Luca Motto Ros - 2020 - Journal of Mathematical Logic 21 (1):2050025.
    Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230 80, Chap. 7], we show that there is a tight connection between the depth of a classifiable shallow theory [Formula: see text] and the Borel rank of the isomorphism relation [Formula: see text] on its models of size [Formula: see text], for [Formula: see text] any cardinal satisfying [Formula: see text]. This is achieved by (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31. Pseudofinite Difference Fields and Counting Dimensions.Tingxiang Zou - 2020 - Journal of Mathematical Logic 21 (1):2050022.
    We study a family of ultraproducts of finite fields with the Frobenius automorphism in this paper. Their theories have the strict order property and TP2. But the coarse pseudofinite dimension of the definable sets is definable and integer-valued. Moreover, we also discuss the possible connection between coarse dimension and transformal transcendence degree in these difference fields.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32. Weyl Reexamined: “Das Kontinuum” 100 Years Later.Arnon Avron - 2020 - Bulletin of Symbolic Logic 26 (1):26-79.
    Hermann Weyl was one of the greatest mathematicians of the 20th century, with contributions to many branches of mathematics and physics. In 1918 he wrote a famous book, “Das Kontinuum”, on the foundations of mathematics. In that book he described mathematical analysis as a ‘house built on sand’, and tried to ‘replace this shifting foundation with pillars of enduring strength’. In this paper we reexamine and explain the philosophical and mathematical ideas that underly Weyl’s system in “Das Kontinuum”, and show (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. Inference as Consciousness of Necessity.Eric Marcus - 2020 - Analytic Philosophy 61 (4):304-322.
    Consider the following three claims. (i) There are no truths of the form ‘p and ~p’. (ii) No one holds a belief of the form ‘p and ~p’. (iii) No one holds any pairs of beliefs of the form {p, ~p}. Irad Kimhi has recently argued, in effect, that each of these claims holds and holds with metaphysical necessity. Furthermore, he maintains that they are ultimately not distinct claims at all, but the same claim formulated in different ways. I find (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34. Nonrepresentable Relation Algebras From Groups.Hajnal Andréka, István Németi & Steven Givant - 2020 - Review of Symbolic Logic 13 (4):861-881.
    A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We present our main construction in terms of polygroupoids.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Gündelik dilin mantıksızlığı.Besim Karakadılar - manuscript
    Mantık, yirminci yüzyıldaki gelişimi bakımından ele alındığında, matematik, bilgisayar bilimi, dilbilim ve felsefe gibi alanlarla sıkı kavramsal bağlantılar kuran bir disiplin haline gelmiştir. Tüm bu alanların gündelik dilde izi sürülen anlamalar, anlaşmalar, anlatmalar vb. edimler için birşeyler söyleyebileceğini ya da yapabileceğini varsayabiliriz. Ancak bu varsayım gündelik dilin mantığıyla ya da mantıksızlıklarıyla doğrudan başedebilecek bir anlama yetisi kazanmanın kolay bir yolu olduğu anlamına gelmez. Modern mantık matematikseldir ve gündelik dilde bir kolaylık sağlamaz; aksine işleri olduğundan da karmaşık hale getirir.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  36. Reism, Concretism and Schopenhauer Diagrams.Jens Lemanski & Michał Dobrzański - 2020 - Studia Humana 9 (3/4):104-119.
    Reism or concretism are the labels for a position in ontology and semantics that is represented by various philosophers. As Kazimierz Ajdukiewicz and Jan Woleński have shown, there are two dimensions with which the abstract expression of reism can be made concrete: The ontological dimension of reism says that only things exist; the semantic dimension of reism says that all concepts must be reduced to concrete terms in order to be meaningful. In this paper we argue for the following two (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  37. Oldthinkful Duckspeak Refs Opposites Rewrite Fullwise Upsub Antefiling.Keith Begley - 2018 - In Ezio Di Nucci & Stefan Storrie (eds.), 1984 and Philosophy: Is Resistance Futile? Chicago, IL, USA: pp. 255–265.
    "It’s a beautiful thing, the destruction of words. Of course the great wastage is in the verbs and adjectives, but there are hundreds of nouns that can be got rid of as well. It isn’t only the synonyms; there are also the antonyms. After all, what justification is there for a word which is simply the opposite of some other word? A word contains its opposite in itself. Take “good”, for instance. If you have a word like “good”, what need (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  38. The Logic of Conditional Belief.Benjamin Eva - 2020 - Philosophical Quarterly 70 (281):759-779.
    The logic of indicative conditionals remains the topic of deep and intractable philosophical disagreement. I show that two influential epistemic norms—the Lockean theory of belief and the Ramsey test for conditional belief—are jointly sufficient to ground a powerful new argument for a particular conception of the logic of indicative conditionals. Specifically, the argument demonstrates, contrary to the received historical narrative, that there is a real sense in which Stalnaker’s semantics for the indicative did succeed in capturing the logic of the (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39. Preservation Theorems for Namba Forcing.Osvaldo Guzmán, Michael Hrušák & Jindřich Zapletal - 2021 - Annals of Pure and Applied Logic 172 (2):102869.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Universal Logic in Terms of Quantum Information.Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (9):1-5.
    Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be interpreted. The (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  41. The Logic of Information in State Spaces.Levin Hornischer - forthcoming - Review of Symbolic Logic:1-32.
    State spaces are, in the most general sense, sets of entities that contain information. Examples include states of dynamical systems, processes of observations, or possible worlds. We use domain theory to describe the structure of positive and negative information in state spaces. We present examples ranging from the space of trajectories of a dynamical system, over Dunn’s aboutness interpretation of fde, to the space of open sets of a spectral space. We show that these information structures induce so-called hype models (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42. A Quantificational Analysis of the Liar Paradox.Matheus Silva - manuscript
    It seems that the most common strategy to solve the liar paradox is to argue that liar sentences are meaningless and, consequently, truth-valueless. The other main option that has grown in recent years is the dialetheist view that treats liar sentences as meaningful, truth-apt and true. In this paper I will offer a new approach that does not belong in either camp. I hope to show that liar sentences can be interpreted as meaningful, truth-apt and false, but without engendering any (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  43. Locally Definable Subgroups of Semialgebraic Groups.Elías Baro, Pantelis E. Eleftheriou & Ya’Acov Peterzil - 2019 - Journal of Mathematical Logic 20 (2):2050009.
    We prove the following instance of a conjecture stated in [P. E. Eleftheriou and Y. Peterzil, Definable quotients of locally definable groups, Selecta Math. 18 885–903]. Let [Formula: see text] be an abelian semialgebraic group over a real closed field [Formula: see text] and let [Formula: see text] be a semialgebraic subset of [Formula: see text]. Then the group generated by [Formula: see text] contains a generic set and, if connected, it is divisible. More generally, the same result holds when (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44. Definable V-Topologies, Henselianity and NIP.Yatir Halevi, Assaf Hasson & Franziska Jahnke - 2019 - Journal of Mathematical Logic 20 (2):2050008.
    We initiate the study of definable [Formula: see text]-topologies and show that there is at most one such [Formula: see text]-topology on a [Formula: see text]-henselian NIP field. Equivalently, we show that if [Formula: see text] is a bi-valued NIP field with [Formula: see text] henselian, then [Formula: see text] and [Formula: see text] are comparable. As a consequence, Shelah’s conjecture for NIP fields implies the henselianity conjecture for NIP fields. Furthermore, the latter conjecture is proved for any field admitting (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45. On Searching Explanatory Argumentation Graphs.Régis Riveret - 2020 - Journal of Applied Non-Classical Logics 30 (2):123-192.
    Cases or examples can be often explained by the interplay of arguments in favour or against their outcomes. This paper addresses the problem of finding explanations for a collection of cases where an explanation is a labelled argumentation graph consistent with the cases, and a case is represented as a statement labelling. The focus is on semi-abstract argumentation graphs specifying attack and subargument relations between arguments, along with particular complete argument labellings taken from probabilistic argumentation where arguments can be excluded. (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46. Herzberger’s Limit Rule with Labelled Sequent Calculus.Andreas Fjellstad - 2020 - Studia Logica 108 (4):815-855.
    Inspired by recent work on proof theory for modal logic, this paper develops a cut-free labelled sequent calculus obtained by imitating Herzberger’s limit rule for revision sequences as a clause in a possible world semantics. With the help of two completeness theorems, one between the labelled sequent calculus and the corresponding possible world semantics, and one between the axiomatic theory of truth PosFS and a neighbourhood semantics, together with the proof of the equivalence between the two semantics, we show that (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  47. On Equivalence Relations Generated by Cauchy Sequences in Countable Metric Spaces.Longyun Ding & Kai Gu - 2020 - Annals of Pure and Applied Logic 171 (10):102854.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48. Computation and Indispensability.Jeffrey Ketland - forthcoming - Logic and Logical Philosophy:1.
    This article provides a computational example of a mathematical explanation within science, concerning computational equivalence of programs. In addition, it outlines the logical structure of the reasoning involved in explanations in applied mathematics. It concludes with a challenge that the nominalist provide a nominalistic explanation for the computational equivalence of certain programs.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49. Peter Ochs and the Logic of Scriptural Reasoning.Mark Randall James - forthcoming - Modern Theology.
  50. The Value of Thinking and the Normativity of Logic.Manish Oza - 2020 - Philosophers' Imprint 20 (25):1-23.
    (1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) I argue that, while (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 25229