This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

6184 found
Order:
1 — 50 / 6184
  1. A Methodological Note on Proving Agreement Between the Elementary Process Theory and Modern Interaction Theories.Cabbolet Marcoen - manuscript
    The Elementary Process Theory (EPT) is a collection of seven elementary process-physical principles that describe the individual processes by which interactions have to take place for repulsive gravity to exist. One of the two main problems of the EPT is that there is no proof that the four fundamental interactions (gravitational, electromagnetic, strong, and weak) as we know them can take place in the elementary processes described by the EPT. This paper sets forth the method by which it can be (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. A Statistical Learning Approach to a Problem of Induction.Kino Zhao - manuscript
    At its strongest, Hume's problem of induction denies the existence of any well justified assumptionless inductive inference rule. At the weakest, it challenges our ability to articulate and apply good inductive inference rules. This paper examines an analysis that is closer to the latter camp. It reviews one answer to this problem drawn from the VC theorem in statistical learning theory and argues for its inadequacy. In particular, I show that it cannot be computed, in general, whether we are in (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  3. Two Notes on Abstract Model Theory. I. Properties Invariant on the Range of Definable Relations Between Structures.Solomon Feferman with with R. L. Vaught - manuscript
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Two Notes on Abstract Model Theory. II. Languages for Which the Set of Valid Sentences is Semi-Invariantly Implicitly Definable.Solomon Feferman with with R. L. Vaught - manuscript
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  5. Rijke. PDL for Ordered Trees.Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Gaiffe Evan, Goris Maarten & Marx Maarten - forthcoming - Journal of Applied Non-Classical Logics.
  6. Dependent Choice, Properness, and Generic Absoluteness.David Asperó & Asaf Karagila - forthcoming - Review of Symbolic Logic:1-25.
    We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Syntactic Characterizations of First-Order Structures in Mathematical Fuzzy Logic.Guillermo Badia, Pilar Dellunde, Vicent Costa & Carles Noguera - forthcoming - Soft Computing.
    This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Genericity.and Fabio Del Prete C. Beyssade /Alda Mari (ed.) - forthcoming - Oxford University Press.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  9. Domain Formula Circumscription.Tom Costello - forthcoming - Journal of Logic Language and Information.
  10. Sur Quelques Relations Entre Les Zéros Et Les poLes Des Fonctions Méromorphes. Applications au Developpement de Mittag-Leffler.Jeanne Férentinou-Nicolacopoulou - forthcoming - Eleutheria.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  11. Absoluteness and the Skolem Paradox.Michael Hallett - forthcoming - Unpublished.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  12. The Taming of Content: Some Thoughts About Domains and Modules.Keith J. Holyoak & Patricia W. Cheng - forthcoming - Thinking and Reasoning.
  13. A Bounded Arithmetictheory for LOGCFL.S. Kuroda - forthcoming - Archive for Mathematical Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  14. Completely Separable Mad Families and the Modal Logic of Βω.Tomáš Lávička & Jonathan L. Verner - forthcoming - Journal of Symbolic Logic:1-10.
  15. Badiou, Mathematics, and Model Theory.Paul Livingston - forthcoming - MonoKL.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  16. Hyperbolic Towers and Independent Generic Sets in the Theory of Free Groups, to Appear in the Proceedings of the Conference" Recent Developments in Model Theory.Lars Louder, Chloé Perin & Rizos Sklinos - forthcoming - Notre Dame Journal of Formal Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  17. Mitchell-Inspired Forcing, with Small Working Parts and Collections of Models of Uniform Size as Side Conditions, and Gap-One Simplified Morasses.Charles Morgan - forthcoming - Journal of Symbolic Logic:1-35.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. Definability in Valued Ore Modules.Françoise Point - forthcoming - Bulletin of Symbolic Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  19. Quine’s Fluted Fragment Revisited.Ian Pratt-Hartmann, Wiesław Szwast & Lidia Tendera - forthcoming - Journal of Symbolic Logic:1-30.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Special Issue on Recent Advances in Logical and Algebraic Approaches to Grammar, Volume 7 (4) Of.C. Retoré - forthcoming - Journal of Logic Language and Information.
    This a special issue of the Journal of Logic Language and Information that I edited.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  21. A Fully Model-Theoretic Semantics for Model-Preference Default Systems', Istituto di Elaborazione dell'Informazione, Pisa.F. Sebastiani - forthcoming - Studia Logica.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  22. On the Notion of Guessing Model.Matteo Viale - forthcoming - Annals of Pure and Applied Logic.
  23. On Stalnaker’s Simple Theory of Propositions.Peter Fritz - 2021 - Journal of Philosophical Logic 50 (1):1-31.
    Robert Stalnaker recently proposed a simple theory of propositions using the notion of a set of propositions being consistent, and conjectured that this theory is equivalent to the claim that propositions form a complete atomic Boolean algebra. This paper clarifies and confirms this conjecture. Stalnaker also noted that some of the principles of his theory may be given up, depending on the intended notion of proposition. This paper therefore also investigates weakened constraints on consistency and the corresponding classes of Boolean (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  24. Finitely Generated Groups Are Universal Among Finitely Generated Structures.Matthew Harrison-Trainor & Meng-Che “Turbo” Ho - 2021 - Annals of Pure and Applied Logic 172 (1):102855.
    Universality has been an important concept in computable structure theory. A class C of structures is universal if, informally, for any structure of any kind there is a structure in C with the same computability-theoretic properties as the given structure. Many classes such as graphs, groups, and fields are known to be universal. This paper is about the class of finitely generated groups. Because finitely generated structures are relatively simple, the class of finitely generated groups has no hope of being (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Kripke Semantics for Intuitionistic Łukasiewicz Logic.A. Lewis-Smith, P. Oliva & E. Robinson - 2021 - Studia Logica 109 (2):313-339.
    This paper proposes a generalization of the Kripke semantics of intuitionistic logic IL appropriate for intuitionistic Łukasiewicz logic IŁL — a logic in the intersection between IL and (classical) Łukasiewicz logic. This generalised Kripke semantics is based on the poset sum construction, used in Bova and Montagna (Theoret Comput Sci 410(12):1143–1158, 2009) to show the decidability (and PSPACE completeness) of the quasiequational theory of commutative, integral and bounded GBL algebras. The main idea is that w \Vdash \sigma—which for IL is (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  26. Generalizing Empirical Adequacy II: Partial Structures.Sebastian Lutz - 2021 - Synthese 198 (2):1351-1380.
    I show that extant attempts to capture and generalize empirical adequacy in terms of partial structures fail. Indeed, the motivations for the generalizations in the partial structures approach are better met by the generalizations via approximation sets developed in “Generalizing Empirical Adequacy I”. Approximation sets also generalize partial structures.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27. Pooling Modalities and Pointwise Intersection: Axiomatization and Decidability.Frederik Van De Putte & Dominik Klein - 2021 - Studia Logica 109 (1):47-93.
    We establish completeness and the finite model property for logics featuring the pooling modalities that were introduced in Van De Putte and Klein. The definition of our canonical models combines standard techniques with a so-called “puzzle piece construction”, which we first illustrate informally. After that, we apply it to the weakest classical logics with pooling modalities and investigate the technique’s potential for the axiomatization of stronger logics, obtained by imposing well-known frame conditions on the models.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  28. Determinate Logic and the Axiom of Choice.J. P. Aguilera - 2020 - Annals of Pure and Applied Logic 171 (2):102745.
    Takeuti introduced an infinitary proof system for determinate logic and showed that for transitive models of Zermelo-Fraenkel set theory with the Axiom of Dependent Choice that contain all reals, the cut-elimination theorem is equivalent to the Axiom of Determinacy, and in particular contradicts the Axiom of Choice. We consider variants of Takeuti's theorem without assuming the failure of the Axiom of Choice. For instance, we show that if one removes atomic formulae of infinite arity from the language of Takeuti's proof (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. On Classical Set-Compatibility.Luis Felipe Bartolo Alegre - 2020 - El Jardín de Senderos Que Se Bifurcan y Confluyen: Filosofía, Lógica y Matemáticas.
    In this paper, I generalise the logical concept of compatibility into a broader set-theoretical one. The basic idea is that two sets are incompatible if they produce at least one pair of opposite objects under some operation. I formalise opposition as an operation ′ ∶ E → E, where E is the set of opposable elements of our universe U, and I propose some models. From this, I define a relation ℘U × ℘U × ℘U^℘U, which has (mutual) logical compatibility (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  30. Diagonal Supercompact Radin Forcing.Omer Ben-Neria, Chris Lambie-Hanson & Spencer Unger - 2020 - Annals of Pure and Applied Logic 171 (10):102828.
    Motivated by the goal of constructing a model in which there are no κ-Aronszajn trees for any regular $k>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square fail.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Weakly Minimal Groups with a New Predicate.Gabriel Conant & Michael C. Laskowski - 2020 - Journal of Mathematical Logic 20 (2):2050011.
    Fix a weakly minimal (i.e. superstable U-rank 1) structure M. Let M∗ be an expansion by constants for an elementary substructure, and let A be an arbitrary subset of the universe M. We show that all formulas in the expansion (M∗,A) are equivalent to bounded formulas, and so (M,A) is stable (or NIP) if and only if the M-induced structure AM on A is stable (or NIP). We then restrict to the case that M is a pure abelian group with (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32. Intuitionistic Non-normal Modal Logics: A General Framework.Tiziano Dalmonte, Charles Grellois & Nicola Olivetti - 2020 - Journal of Philosophical Logic 49 (5):833-882.
    We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. We thereby obtain a lattice of 24 distinct bimodal logics. For all logics we provide both a Hilbert (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  33. Perfect Tree Forcings for Singular Cardinals.Natasha Dobrinen, Dan Hathaway & Karel Prikry - 2020 - Annals of Pure and Applied Logic 171 (9):102827.
  34. A Model-Theoretic Analysis of Fidel-Structures for mbC.Marcelo E. Coniglio - 2020 - In Can Baskent and Thomas Ferguson (ed.), Graham Priest on Dialetheism and Paraconsistency. Springer. pp. 189-216.
    In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order to (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  35. Uniformly Locally o-Minimal Structures and Locally o-Minimal Structures Admitting Local Definable Cell Decomposition.Masato Fujita - 2020 - Annals of Pure and Applied Logic 171 (2):102756.
    We define and investigate a uniformly locally o-minimal structure of the second kind in this paper. All uniformly locally o-minimal structures of the second kind have local monotonicity, which is a local version of monotonicity theorem of o-minimal structures. We also demonstrate a local definable cell decomposition theorem for definably complete uniformly locally o-minimal structures of the second kind. We define dimension of a definable set and investigate its basic properties when the given structure is a locally o-minimal structure which (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Distality for the Asymptotic Couple of the Field of Logarithmic Transseries.Allen Gehret & Elliot Kaplan - 2020 - Notre Dame Journal of Formal Logic 61 (2):341-361.
    We show that the theory Tlog of the asymptotic couple of the field of logarithmic transseries is distal. As distal theories are NIP, this provides a new proof that Tlog is NIP.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37. Extender-Based Forcings with Overlapping Extenders and Negations of the Shelah Weak Hypothesis.Moti Gitik - 2020 - Journal of Mathematical Logic 20 (3):2050013.
    Extender-based Prikry–Magidor forcing for overlapping extenders is introduced. As an application, models with strong forms of negations of the Shelah Weak Hypothesis for various cofinalities are constructed.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38. Silver Type Theorems for Collapses.Moti Gitik - 2020 - Annals of Pure and Applied Logic 171 (9):102825.
    Let κ be a cardinal of cofinality \omega_1 witnessed by a club of cardinals (κ_\alpha | \alpha < \omega_1) . We study Silver's type effects of collapsing of κ^+_\alphas 's on κ^+ . A model in which κ^+_\alphas 's (and also κ^+) are collapsed on a stationary co-stationary set is constructed.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39. Definable Operators on Stable Set Lattices.Robert Goldblatt - 2020 - Studia Logica 108 (6):1263-1280.
    A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  40. Indestructibility of the Tree Property.Radek Honzik & Šárka Stejskalová - 2020 - Journal of Symbolic Logic 85 (1):467-485.
    In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$, and λ is weakly compact, then in $V\left[M {\left} \right]$ the tree property at $$\lambda = \left^{V\left[ {\left} \right]} $$ is indestructible under all ${\kappa ^ + }$-cc forcing notions which live in $V\left[ {{\rm{Add}}\left} \right]$, where ${\rm{Add}}\left$ is the Cohen forcing for adding λ-many subsets of κ and $\left$ is the standard Mitchell forcing for (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41. Extended Contact Algebras and Internal Connectedness.Tatyana Ivanova - 2020 - Studia Logica 108 (2):239-254.
    The notion of contact algebra is one of the main tools in the region-based theory of space. It is an extension of Boolean algebra with an additional relation C, called contact. Standard models of contact algebras are topological and are the contact algebras of regular closed sets in a given topological space. In such a contact algebra we add the predicate of internal connectedness with the following meaning—a regular closed set is internally connected if and only if its interior is (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  42. Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic.Norihiro Kamide & Yoni Zohar - 2020 - Studia Logica 108 (3):549-571.
    In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. Uniformly Bounded Arrays and Mutually Algebraic Structures.Michael C. Laskowski & Caroline A. Terry - 2020 - Notre Dame Journal of Formal Logic 61 (2):265-282.
    We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure M. We prove that if T is a complete L-theory, then T is mutually algebraic if and only if there is some model M of T for which every atomic formula has uniformly bounded arrays. Moreover, an incomplete theory T is mutually algebraic if and only if every atomic formula has uniformly bounded arrays in every model M of T.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44. Countably Many Weakenings of Belnap–Dunn Logic.Minghui Ma & Yuanlei Lin - 2020 - Studia Logica 108 (2):163-198.
    Every Berman’s variety \ which is the subvariety of Ockham algebras defined by the equation \ and \) determines a finitary substitution invariant consequence relation \. A sequent system \ is introduced as an axiomatization of the consequence relation \. The system \ is characterized by a single finite frame \ under the frame semantics given for the formal language. By the duality between frames and algebras, \ can be viewed as a \-valued logic as it is characterized by a (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  45. On Morita Equivalence and Interpretability.Paul Anh Mceldowney - 2020 - Review of Symbolic Logic 13 (2):388-415.
    In a recent article, Barrett & Halvorson define a notion of equivalence for first-order theories, which they call “Morita equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this article is to challenge this central claim by raising objections to their argument for it and by showing why there is good reason to think that the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. A Canonical Model for Constant Domain Basic First-Order Logic.Ben Middleton - 2020 - Studia Logica 108 (6):1307-1323.
    I build a canonical model for constant domain basic first-order logic (BQLCD), the constant domain first-order extension of Visser’s basic propositional logic, and use the canonical model to verify that BQLCD satisfies the disjunction and existence properties.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  47. Epimorphisms, Definability and Cardinalities.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Studia Logica 108 (2):255-275.
    We characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures. This allows us to strengthen a result of Bacsich, as follows: in any prevariety having at most \ non-logical symbols and an axiomatization requiring at most \ variables, if the epimorphisms into structures with at most \ elements are surjective, then so are all of the epimorphisms. Using these facts, we formulate and prove manageable ‘bridge theorems’, matching the surjectivity of all epimorphisms in (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  48. Varieties of de Morgan Monoids: Covers of Atoms.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Review of Symbolic Logic 13 (2):338-374.
    The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Epimorphism Surjectivity in Varieties of Heyting Algebras.T. Moraschini & J. J. Wannenburg - 2020 - Annals of Pure and Applied Logic 171 (9):102824.
    It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K . It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. Simplified Kripke-Style Semantics for Some Normal Modal Logics.Andrzej Pietruszczak, Mateusz Klonowski & Yaroslav Petrukhin - 2020 - Studia Logica 108 (3):451-476.
    Pietruszczak :163–171, 2009. https://doi.org/10.12775/LLP.2009.013) proved that the normal logics \, \ ), \ are determined by suitable classes of simplified Kripke frames of the form \, where \. In this paper, we extend this result. Firstly, we show that a modal logic is determined by a class composed of simplified frames if and only if it is a normal extension of \. Furthermore, a modal logic is a normal extension of \ ; \; \) if and only if it is (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
1 — 50 / 6184