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.

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.

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.

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 (...) real closed fields. Here we further develop this analogy. We establish an o-minimal style cell decomposition for weakly o-minimal non-valuational expansions of ordered groups. For structures enjoying such a strong cell decomposition we construct a canonical o-minimal extension. Finally, we make attempts towards generalizing the o-minimal Euler characteristic to the class of sets definable in weakly o-minimal structures with the strong cell decomposition property. (shrink)

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 (...) the Exchange Principle for algebraic closure in a weakly o-minimal structure. (shrink)

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.

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.

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 (...) classified up to binary structure; the structure is 2-indiscernible, classified up to ternary structure; the structure is 3-indiscernible, in which case we show that it is k-indiscernible for every finite k. We also make some remarks about the possible structures of higher arities which an 0-categorical weakly o-minimal structure may carry. (shrink)

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 (...) that generates the structure. (shrink)

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 (...) has nothing to do with the circularity or non-circularity of the test, but is instead based on the minimal empiricality and reliability of observations. Since theory-dependence does not in general prevent observations fulfilling these requirements, it should not be regarded as a phenomenon that is basically detrimental, but as neutral with respect to successful scientific knowledge gathering. (shrink)

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.

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 (...) set is a union of finitely many open $\mathrm{CE}$-cells, has $\mathrm{CE}$-cell decomposition. (shrink)

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 (...) expansions of Boolean lattices, every weakly o-minimal theory is p-ω-categorical. (shrink)

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.

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 (...) of Cartesian products of definable sets, showing that if X, Y and S are non-empty definable sets and S is a large subset of X × Y, then for a large set of tuples $\langle \overline{a}_{1},\ldots,\overline{a}_{2^{k}}\rangle \in X^{2^{k}}$ , where k = dim(Y), the union of fibers $S_{\overline{a}_{1}}\cup \cdots \cup S_{\overline{a}_{2^{k}}}$ is large in Y. Finally, given a weakly o-minimal structure ������, we find various conditions equivalent to the fact that the topological dimension in ������ enjoys the addition property. (shrink)

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 (...) T, any expansion M + of M by a family of unary predicates has a weakly o-minimal theory iff the set of all realizations of each predicate is a union of a finite number of convex sets (Theorem 63), that solves the Problem of Cherlin-Macpherson-Marker-Steinhorn [MMS] for the class of weakly o-minimal theories. (shrink)

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 (...) version of IVP. After introducing a weak version of definable connectedness 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}, we prove that strong cells 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} are weakly definably connected, so every set 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} is a finite union of its weakly definably connected components, provided that 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} has the strong cell decomposition property. Then, we consider a local continuity property for 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} and conclude some results on cell decomposition regarding that property. Finally, we extend the notion of having no dense graph which was examined for definable functions in and related to uniform finiteness, definable completeness, and others. We show that every weakly o-minimal structure 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} having cell decomposition, satisfies NDG, i.e. every definable function 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} has no dense graph. (shrink)

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.

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.

Informal construction -- Formal construction -- Limiting results.

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.

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 (...) 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}, then the resulting theory is no longer essentially undecidable. Moreover, we give a positive answer to Grzegorczyk and Zdanowski’s conjecture that ‘The 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’. For the alternative theories 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 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}}$$\end{document} which have the empty string, we also prove that the each theory without the neutrality of ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon}$$\end{document} is to be such a theory too. (shrink)

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 (...) a weakly minimal theory, and AM is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of (Z,+). Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form (M,A). Most notably, we show that if (G,+) is a weakly minimal additive subgroup of the algebraic numbers, A⊆G is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of A is a root of unity, then (G,+,B) is superstable for any B⊆A. (shrink)

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 (...) of conflict, or because of their present standing in society, made worse off by historical injustices. To this end, the article considers, respectively, the problems of moral standing, indivisible goods and historical injustice. (shrink)

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 (...) one. While there have been full approximation constructions of ${\rm{\Delta }}_3^0$ minimal degrees before, our proof is rather novel since it is a computable full approximation construction where both the generic and the minimal degrees are ${\rm{\Delta }}_3^0 - {\rm{\Delta }}_2^0$. (shrink)

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 (...) minimal and D the realizations of $\operatorname{stp}(a/A)$ for some a realizing p. Then D is locally modular or p has Morley rank 1. Theorem 2. Let H, G be definable over some finite A, weakly minimal, locally modular and nonorthogonal. Then for all $a \in H\backslash\operatorname{acl}(A), b \in G\operatorname{acl}(A)$ there are a' ∈ H, b' ∈ G such that $a' \in \operatorname{acl}(abb' A)\backslash\operatorname{acl}(aA)$ . Similarly when H and G are the realizations of complete types or strong types over A. (shrink)

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 (...) over some finite field. We then specify what other structure θ/E may inherit: there is some collection of definable subspaces of finite codimension and some set of algebraic points, which in the affine case may be in the canonically associated vector space, Up to acl, no further structure is possible. If we assume T is weakly minimal and has a strong type p as above, and also that T is unidimensional, we obtain a global description of any model of T in terms of those structures mentioned in the previous paragraph. (shrink)

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 (...) prime model over A is not minimal over A. (shrink)

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 (...) that the universe is weakly minimal and locally modular. Then for all finite A there is a finite $B \subset \mathrm{cl}(A)$ such that a ∈ cl(A) iff a ∈ cl(b) for some b ∈ B. Recall the property (S) defined in the abstract of [B1]. THEOREM C. Let T be as in Theorem B. Then, if T does not satisfy (S), T has 2 ℵ 0 many countable models. Combining Theorem C and the results in [B1] we obtain Vaught's conjecture for such theories. (shrink)

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 + (...) ∑ i ≤ n r ib i ∈ A and $s \not\in I$ . It follows from Theorem A that algebraic closure in M is modular. Using this and results in [B1] and [B2], we obtain Theorem B. Let M be as in Theorem A. Then Vaught's conjecture holds for Th(M). (shrink)

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 (...) of a divisible ordered Abelian group which is dp-minimal and not weakly o-minimal. Finally we establish that the field of p -adic numbers is dp-minimal. (shrink)

Modifying the descriptive and theoretical generalizations of Relativized Minimality, we argue that a significant subset of weak island violations arise when an extracted phrase should scope over some intervener but is unable to. Harmless interveners seem harmless because they can support an alternative reading. This paper focuses on why certain wh-phrases are poor wide scope takers, and offers an algebraic perspective on scope interaction. Each scopal element SE is associated with certain operations (e.g., not with complements). When a (...) wh-phrase scopes over some SE, the operations associated with that SE are performed in its denotation domain. The requisite operations may or may not be available in a domain, however. We present an empirical analysis of a variety of wh-phrases. It is argued that the wh-phrases that escape all weak islands (i.e., can scope over any intervener) are those that range over individuals, the reason being that all Boolean operations are defined for their domain. Collectives, manners, amounts, numbers, etc. all denote in domains with fewer operations and are thus selectively sensitive to scopal interveners—a “semantic relativized minimality effect”. (shrink)

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.

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 (...) of whether arguments are circular and whether they are reasonable. The results suggest that direct judgments of circularity depend heavily on repetition and structural role of claims, but only minimally on grounding. Judgments of reasonableness take repetition and grounding into account, but are relatively insensitive to structural role. (shrink)

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 (...) argumentation. In the face of such an argument the arguer might just as well have merely asserted the conclusion. (shrink)

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 (...) that this view has a variety of advantages that could make it attractive to people with both Humean and anti-Humean inclinations. (shrink)

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.

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.