Results for 'Weak circular minimality'

1000+ found
Order:
  1.  14
    On weakly circularly minimal groups.Beibut Sh Kulpeshov & Viktor V. Verbovskiy - 2015 - Mathematical Logic Quarterly 61 (1-2):82-90.
    Here we study properties of weakly circularly minimal cyclically ordered groups. The main result of the paper is that any weakly circularly minimal cyclically ordered group is abelian.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  28
    On ℵ0‐categorical weakly circularly minimal structures.Beibut Sh Kulpeshov - 2006 - Mathematical Logic Quarterly 52 (6):555-574.
    We continue exploring analogues of o-minimality and weak o-minimality for circularly ordered sets. The main result is a description of ℵ0-categorical 1-transitive non-primitive weakly circularly minimal structures of convexity rank 1 up to binarity.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  30
    Minimality conditions on circularly ordered structures.Beibut Sh Kulpeshov & H. Dugald Macpherson - 2005 - Mathematical Logic Quarterly 51 (4):377-399.
    We explore analogues of o-minimality and weak o-minimality for circularly ordered sets. Much of the theory goes through almost unchanged, since over a parameter the circular order yields a definable linear order. Working over ∅ there are differences. Our main result is a structure theory for ℵ0-categorical weakly circularly minimal structures. There is a 5-homogeneous example which is not 6-homogeneous, but any example which is k-homogeneous for some k ≥ 6 is k-homogeneous for all k.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  12
    Weakly o-minimal nonvaluational structures.Roman Wencel - 2008 - Annals of Pure and Applied Logic 154 (3):139-162.
    A weakly o-minimal structure image expanding an ordered group is called nonvaluational iff for every cut left angle bracketC,Dright-pointing angle bracket of definable in image, we have that inf{y−x:xset membership, variantC,yset membership, variantD}=0. The study of nonvaluational weakly o-minimal expansions of real closed fields carried out in [D. Macpherson, D. Marker, C. Steinhorn,Weakly o-minimal structures and real closed fields, Trans. Amer. Math. Soc. 352 5435–5483. MR1781273 (2001i:03079] suggests that this class is very close to the class of o-minimal expansions of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  5. Weakly o-minimal structures and some of their properties.B. Sh Kulpeshov - 1998 - Journal of Symbolic Logic 63 (4):1511-1528.
    The main result of this paper is Theorem 3.1 which is a criterion for weak o-minimality of a linearly ordered structure in terms of realizations of 1-types. Here we also prove some other properties of weakly o-minimal structures. In particular, we characterize all weakly o-minimal linear orderings in the signature $\{ . Moreover, we present a criterion for density of isolated types of a weakly o-minimal theory. Lastly, at the end of the paper we present some remarks on (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  6.  16
    Weakly o-Minimal Expansions of Boolean Algebras.Carlo Toffalori & S. Leonesi - 2001 - Mathematical Logic Quarterly 47 (2):223-238.
    We propose a definition of weak o-minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o-minimal non o-minimal examples in this setting.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  43
    On ℵ0-categorical weakly o-minimal structures.B. Herwig, H. D. Macpherson, G. Martin, A. Nurtazin & J. K. Truss - 1999 - Annals of Pure and Applied Logic 101 (1):65-93.
    0-categorical o-minimal structures were completely described by Pillay and Steinhorn 565–592), and are essentially built up from copies of the rationals as an ordered set by ‘cutting and copying’. Here we investigate the possible structures which an 0-categorical weakly o-minimal set may carry, and find that there are some rather more interesting examples. We show that even here the possibilities are limited. We subdivide our study into the following principal cases: the structure is 1-indiscernible, in which case all possibilities are (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  8. Why worry about theory‐dependence? Circularity, minimal empiricality and reliability.Matthias Adam - 2004 - International Studies in the Philosophy of Science 18 (2 & 3):117 – 132.
    It is a widely shared view among philosophers of science that the theory-dependence (or theory-ladenness) of observations is worrying, because it can bias empirical tests in favour of the tested theories. These doubts are taken to be dispelled if an observation is influenced by a theory independent of the tested theory and thus circularity is avoided, while (partially) circular tests are taken to require special attention. Contrary to this consensus, it is argued that the epistemic value of theory-dependent tests (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  9.  55
    A Note on Weakly O-Minimal Structures and Definable Completeness.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48 (2):281-292.
    We consider the extent to which certain properties of definably complete structures may persist in structures which are not definably complete, particularly in the weakly o-minimal structures.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  23
    T-Height in Weakly O-Minimal Structures.James Tyne - 2006 - Journal of Symbolic Logic 71 (3):747 - 762.
    Given a weakly o-minimal theory T, the T-height of an element of a model of T is defined as a means of classifying the order of magnitude of the element. If T satisfies some easily met technical conditions, then this classification is coarse enough for a Wilkie-type inequality: given a set of elements of a model of T, each of which has a different T-height, the cardinality of this set is at most 1 plus the minimum cardinality of a set (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  11.  43
    Binary types in ℵ0‐categorical weakly o‐minimal theories.Beibut Sh Kulpeshov - 2011 - Mathematical Logic Quarterly 57 (3):246-255.
    Orthogonality of all families of pairwise weakly orthogonal 1-types for ℵ0-categorical weakly o-minimal theories of finite convexity rank has been proved in 6. Here we prove orthogonality of all such families for binary 1-types in an arbitrary ℵ0-categorical weakly o-minimal theory and give an extended criterion for binarity of ℵ0-categorical weakly o-minimal theories . © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  26
    Filling certain cuts in discrete weakly o-minimal structures.Stefano Leonesi & Carlo Toffalori - 2005 - Mathematical Logic Quarterly 51 (2):145.
    Discrete weakly o-minimal structures, although not so stimulating as their dense counterparts, do exhibit a certain wealth of examples and pathologies. For instance they lack prime models and monotonicity for definable functions, and are not preserved by elementary equivalence. First we exhibit these features. Then we consider a countable theory of weakly o-minimal structures with infinite definable discrete subsets and we study the Boolean algebra of definable sets of its countable models.
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  33
    Topological properties of sets definable in weakly o-minimal structures.Roman Wencel - 2010 - Journal of Symbolic Logic 75 (3):841-867.
    The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, group actions and fields definable in the weakly o-minimal context. We prove that the topological dimension of a set definable in a weakly o-minimal structure is invariant under definable injective maps, strengthening an analogous result from [2] for sets and functions definable in models of weakly o-minimal theories. We pay special attention to large subsets (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  14.  44
    On the Boolean algebras of definable sets in weakly o‐minimal theories.Stefano Leonesi & Carlo Toffalori - 2004 - Mathematical Logic Quarterly 50 (3):241-248.
    We consider the sets definable in the countable models of a weakly o-minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic , in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  43
    Expansion of a model of a weakly o-minimal theory by a family of unary predicates.Bektur Sembiuly Baizhanov - 2001 - Journal of Symbolic Logic 66 (3):1382-1414.
    A subset A $\subseteq$ M of a totally ordered structure M is said to be convex, if for any a, b $\in A: [a . A complete theory of first order is weakly o-minimal (M. Dickmann [D]) if any model M is totally ordered by some $\emptyset$ -definable formula and any subset of M which is definable with parameters from M is a finite union of convex sets. We prove here that for any model M of a weakly o-minimal theory (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  16.  19
    On the strong cell decomposition property for weakly o‐minimal structures.Roman Wencel - 2013 - Mathematical Logic Quarterly 59 (6):452-470.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  17.  33
    SCE-Cell Decomposition and OCP in Weakly O-Minimal Structures.Jafar S. Eivazloo & Somayyeh Tari - 2016 - Notre Dame Journal of Formal Logic 57 (3):399-410.
    Continuous extension cell decomposition in o-minimal structures was introduced by Simon Andrews to establish the open cell property in those structures. Here, we define strong $\mathrm{CE}$-cells in weakly o-minimal structures, and prove that every weakly o-minimal structure with strong cell decomposition has $\mathrm{SCE}$-cell decomposition if and only if its canonical o-minimal extension has $\mathrm{CE}$-cell decomposition. Then, we show that every weakly o-minimal structure with $\mathrm{SCE}$-cell decomposition satisfies $\mathrm{OCP}$. Our last result implies that every o-minimal structure in which every definable open (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18. A note on definable completeness and weak o-minimality.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48:281-292.
  19.  20
    Tame properties of sets and functions definable in weakly o-minimal structures.Jafar S. Eivazloo & Somayyeh Tari - 2014 - Archive for Mathematical Logic 53 (3-4):433-447.
    Let M=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}=}$$\end{document} be a weakly o-minimal expansion of a dense linear order without endpoints. Some tame properties of sets and functions definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} which hold in o-minimal structures, are examined. One of them is the intermediate value property, say IVP. It is shown that strongly continuous definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} satisfy an extended (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  7
    A note on prime models in weakly o‐minimal structures.Somayyeh Tari - 2017 - Mathematical Logic Quarterly 63 (1-2):109-113.
    Let be a weakly o‐minimal structure with the strong cell decomposition property. In this note, we show that the canonical o‐minimal extension of is the unique prime model of the full first order theory of over any set. We also show that if two weakly o‐minimal structures with the strong cell decomposition property are isomorphic then, their canonical o‐minimal extensions are isomorphic too. Finally, we show the uniqueness of the prime models in a complete weakly o‐minimal theory with prime models.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  9
    Does weak quasi-o-minimality behave better than weak o-minimality?Slavko Moconja & Predrag Tanović - 2021 - Archive for Mathematical Logic 61 (1):81-103.
    We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also prove that weak quasi-o-minimality of a theory with respect to one definable linear order implies weak quasi-o-minimality with respect to any other such order.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  13
    Criterion for binarity of ℵ 0 -categorical weakly o-minimal theories.B. Sh Kulpeshov - 2007 - Annals of Pure and Applied Logic 145 (3):354-367.
  23.  27
    Vaught's conjecture for weakly o-minimal theories of convexity rank 1.A. Alibek, B. S. Baizhanov, B. Sh Kulpeshov & T. S. Zambarnaya - 2018 - Annals of Pure and Applied Logic 169 (11):1190-1209.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  16
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  21
    Weak theories of concatenation and minimal essentially undecidable theories: An encounter of WTC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}}$$\end{document} and S2S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{S2S}}$$\end{document}.Kojiro Higuchi & Yoshihiro Horihata - 2014 - Archive for Mathematical Logic 53 (7-8):835-853.
    We consider weak theories of concatenation, that is, theories for strings or texts. We prove that the theory of concatenation WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, which is a weak subtheory of Grzegorczyk’s theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document}, is a minimal essentially undecidable theory, that is, the theory WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document} is essentially undecidable and if one omits an axiom scheme from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  26.  11
    Weakly minimal modules over integral group rings and over related classes of rings.Stefano Leonesi, Sonia L'Innocente & Carlo Toffalori - 2005 - Mathematical Logic Quarterly 51 (6):613-625.
    A module is weakly minimal if and only if every pp-definable subgroup is either finite or of finite index. We study weakly minimal modules over several classes of rings, including valuation domains, Prüfer domains and integral group rings.
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  7
    Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
    Informal construction -- Formal construction -- Limiting results.
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  32
    Weakly minimal groups of unbounded exponent.James Loveys - 1990 - Journal of Symbolic Logic 55 (3):928-937.
  29.  9
    Minimal logical teleology in artifacts and biology connects the two domains and frames mechanisms via epistemic circularity.José Antonio Pérez-Escobar - 2024 - Studies in History and Philosophy of Science Part A 104 (C):23-37.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  52
    Minimal assumption derivation of a weak Clauser–Horne inequality.Samuel Portmann & Adrian Wüthrich - 2007 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 38 (4):844-862.
  31.  55
    The Weak Principle of Universalization and the Vulnerable: Comments on Minimal Morality.Dominick Cooper - 2019 - Analysis 79 (1):116-128.
    In Minimal Morality, Michael Moehler justifies what he calls the weak principle of universalization as a principle of pure instrumental morality. This article addresses the application of this principle and problems associated with it. Specifically, the article focuses on the principle’s ability to protect the interests of the most vulnerable members of society: agents without primary moral standing, specifically non-human animals; and the weakest members of society, either as a result of their diminished relative bargaining power in certain cases (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  8
    A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
    Jockusch showed that 2-generic degrees are downward dense below a 2-generic degree. That is, if a is 2-generic, and $0 < {\bf{b}} < {\bf{a}}$, then there is a 2-generic g with $0 < {\bf{g}} < {\bf{b}}.$ In the case of 1-generic degrees Kumabe, and independently Chong and Downey, constructed a minimal degree computable from a 1-generic degree. We explore the tightness of these results.We solve a question of Barmpalias and Lewis-Pye by constructing a minimal degree computable from a weakly 2-generic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  22
    Weakly minimal formulas: a global approach.Ludomir Newelski - 1990 - Annals of Pure and Applied Logic 46 (1):65-94.
  34.  25
    The geometry of weakly minimal types.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1044-1053.
    Let T be superstable. We say a type p is weakly minimal if R(p, L, ∞) = 1. Let $M \models T$ be uncountable and saturated, H = p(M). We say $D \subset H$ is locally modular if for all $X, Y \subset D$ with $X = \operatorname{acl}(X) \cap D, Y = \operatorname{acl}(Y) \cap D$ and $X \cap Y \neq \varnothing$ , dim(X ∪ Y) + dim(X ∩ Y) = dim(X) + dim(Y). Theorem 1. Let p ∈ S(A) be weakly (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  35.  14
    On locally modular, weakly minimal theories.James Loveys - 1993 - Archive for Mathematical Logic 32 (3):173-194.
  36.  27
    Locally finite weakly minimal theories.James Loveys - 1991 - Annals of Pure and Applied Logic 55 (2):153-203.
    Suppose T is a weakly minimal theory and p a strong 1-type having locally finite but nontrivial geometry. That is, for any M [boxvR] T and finite Fp, there is a finite Gp such that acl∩p = gεGacl∩pM; however, we cannot always choose G = F. Then there are formulas θ and E so that θεp and for any M[boxvR]T, E defines an equivalence relation with finite classes on θ/E definably inherits the structure of either a projective or affine space (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  23
    Isolated types in a weakly minimal set.Steven Buechler - 1987 - Journal of Symbolic Logic 52 (2):543-547.
    Theorem A. Let T be a small superstable theory, A a finite set, and ψ a weakly minimal formula over A which is contained in some nontrivial type which does not have Morley rank. Then ψ is contained in some nonalgebraic isolated type over A. As an application we prove Theorem B. Suppose that T is small and superstable, A is finite, and there is a nontrivial weakly minimal type p ∈ S(A) which does not have Morley rank. Then the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  36
    The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
    The main result is Vaught's conjecture for weakly minimal, locally modular and non-ω-stable theories. The more general results yielding this are the following. THEOREM A. Suppose that T is a small unidimensional theory and D is a weakly minimal set, definable over the finite set B. Then for all finite $A \subset D$ there are only finitely many nonalgebraic strong types over B realized in $\operatorname{acl}(A) \cap D$ . THEOREM B. Suppose that T is a small, unidimensional, non-ω-stable theory such (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  35
    The classification of small weakly minimal sets. III: Modules.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (3):975-979.
    Theorem A. Let M be a left R-module such that Th(M) is small and weakly minimal, but does not have Morley rank 1. Let $A = \mathrm{acl}(\varnothing) \cap M$ and $I = \{r \in R: rM \subset A\}$ . Notice that I is an ideal. (i) F = R/I is a finite field. (ii) Suppose that a, b 0 ,...,b n ∈ M and a b̄. Then there are s, r i ∈ R, i ≤ n, such that sa + (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  40.  6
    A non-minimal but very weak axiomatization of common belief.Luc Lismont & Philippe Mongin - 1994 - Artificial Intelligence 70 (1-2):363-374.
  41.  35
    Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
    We study the notion of dp-minimality, beginning by providing several essential facts about dp-minimality, establishing several equivalent definitions for dp-minimality, and comparing dp-minimality to other minimality notions. The majority of the rest of the paper is dedicated to examples. We establish via a simple proof that any weakly o-minimal theory is dp-minimal and then give an example of a weakly o-minimal group not obtained by adding traces of externally definable sets. Next we give an example (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  42.  53
    The elementary diagram of a trivial, weakly minimal structure is near model complete.Michael C. Laskowski - 2009 - Archive for Mathematical Logic 48 (1):15-24.
    We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  45
    Pathological Circularity: Deductive Validity and a Contextual Account of the Fallacy of Begging the Question.James G. Edwards - unknown
    The purpose of this study is to provide an account of the fallaciousness of begging the question without thereby indicting as fallacious all otherwise acceptable deductively valid reasoning. The solution that we suggest exploits the intuition that all good arguments are weakly circular. The fallaciousness of begging the question is not that the reasoning is circular simpliciter. Rather, begging the question is a fallacy because the conclusion relies on an undischarged assumption that the audience cannot accept without further (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44. Review: T. Traczyk, Minimal Extensions of Weakly Distributive Boolean Algebras. [REVIEW]R. S. Pierce - 1967 - Journal of Symbolic Logic 32 (3):414-415.
  45.  18
    Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models.Christoph Beierle, Christian Eichhorn, Gabriele Kern-Isberner & Steven Kutsch - 2021 - Artificial Intelligence 297 (C):103489.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  37
    Circular reasoning.Lance J. Rips - 2002 - Cognitive Science 26 (6):767-795.
    Good informal arguments offer justification for their conclusions. They go wrong if the justifications double back, rendering the arguments circular. Circularity, however, is not necessarily a single property of an argument, but may depend on (a) whether the argument repeats an earlier claim, (b) whether the repetition occurs within the same line of justification, and (c) whether the claim is properly grounded in agreed‐upon information. The experiments reported here examine whether people take these factors into account in their judgments (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  47.  23
    Tame Topology over dp-Minimal Structures.Pierre Simon & Erik Walsberg - 2019 - Notre Dame Journal of Formal Logic 60 (1):61-76.
    In this article, we develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable sets, definable functions are almost everywhere continuous, and definable sets are finite unions of graphs of definable continuous “multivalued functions.” This generalizes known statements about weakly o-minimal, C-minimal, and P-minimal theories.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48. Minimal Negation in the Ternary Relational Semantics.Gemma Robles, José M. Méndez & Francisco Salto - 2005 - Reports on Mathematical Logic 39:47-65.
    Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending the positive logic. Complete semantics for such kinds of reductio in a properly extended positive logic are offered.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  44
    Minimal Assumption Derivation of a Bell-type Inequality.G. Grasshoff - 2005 - British Journal for the Philosophy of Science 56 (4):663-680.
    John Bell showed that a big class of local hidden-variable models stands in conflict with quantum mechanics and experiment. Recently, there were suggestions that empirically adequate hidden-variable models might exist which presuppose a weaker notion of local causality. We will show that a Bell-type inequality can be derived also from these weaker assumptions. IntroductionThe EPR-Bohm experimentLocal causalityBell's inequality from separate common causes4.1 A weak screening-off principle4.2 Perfect correlation and ‘determinism’4.3 A minimal theory for spins4.4 No conspiracyDiscussion.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  50. Minimal Anti-Humeanism.Harjit Bhogal - 2017 - Australasian Journal of Philosophy 95 (3):447-460.
    There is a tension in our theorizing about laws of nature: our practice of using and reasoning with laws of nature suggests that laws are universal generalizations, but if laws are universal generalizations then we face the problem of explanatory circularity. In this paper I elucidate this tension and show how it motivates a view of laws that I call Minimal Anti-Humeanism. This view says that the laws are the universal generalizations that are not grounded in their instances. I argue (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
1 — 50 / 1000