Let be an o-minimal structure expanding a real closed field R. We show that any definable set in Rn can be stratified into cells, whose defining functions are smooth Lipschitz continuous functions with constant 2n3/2, which have additional regularity conditions on the derivatives of higher order.

The stratification in depth of chromatically homogeneous overlapping figures depends on a minimization rule which assigns the status of being “in front” to the figure that requires the formation of shorter modal contours. This rule has been proven valid also in birds, whose visual neuroanatomy is radically different from that of other mammals, thus suggesting an example of evolutionary convergence toward a perceptual universal. [Shepard].

The account of causal regularities in the influential INUS theory of causation has been refined in the recent developments of the regularity approach to causation and of the Boolean methods for inference of deterministic causal structures. A key element in the refinement is to strengthen the minimality or non-redundancy condition in the original INUS account. In this paper, we argue that the Boolean framework warrants a further strengthening of the minimality condition. We motivate our stronger condition by showing, (...) first, that a rationale for strengthening the original minimality condition in the INUS theory is also applicable to our proposal to go further, and second, that the new element of the stronger condition is a counterpart to a well-established minimality condition for probabilistic causal models. We also compare the various minimality conditions in terms of the difference-making criteria they imply and argue for the criterion implied by our condition. Finally, we show that putative counterexamples to our proposal can be addressed in the same way that the Boolean theorists defend the current minimality conditions in their framework. (shrink)

The Minimal Theory of Causation, presented in Graßhoff and May, 2001, aspires to be a version of a regularity analysis of causation able to correctly predict our causal intuitions. In my article, I will argue that it is unsuccessful in this respect. The second aim of the paper will be to defend Hitchcock’s proposal concerning divisions of causal relations against criticism made, in Jakob, 2006 on the basis of the Minimal Theory of Causation.

The majority of the currently flourishing theories of actual causation are located in a broadly counterfactual framework that draws on structural equations. In order to account for cases of symmetric overdeterminiation and preemption, these theories resort to rather intricate analytical tools, most of all, to what Hitchcock has labeled explicitly nonforetracking counterfactuals. This paper introduces a regularity theoretic approach to actual causation that only employs material conditionals, standard Boolean minimization procedures, and a stability condition that regulates the behavior of causal (...) models under model expansions. Notwithstanding its lightweight analytical toolbox, this regularity theory performs at least as well as the structural equations accounts with their heavy appliances. (shrink)

Regularity theories of causation are guided by the idea that causes are collectively sufficient for their effects. Following Mackie [1974], that idea is typically refined to distinguish collections that include redundant members from those that do not. Causes must be collectively sufficient for their effects without redundancy. While Mackie was surely right that the regularity theory must distinguish collections that are in some sense minimally sufficient for an effect from those that include unnecessary hangers-on, I believe that redundancy is the (...) wrong mark of that distinction. I propose a way to develop the regularity theory without it. Instead of distinguishing minimal from mere sufficiency in terms of redundancy, we should look to the influence that events have in the world. Causes, so construed, must have just enough collective influence to ensure that an effect occurs. I argue that such an account provides a uniform solution to the problem of epiphenomena and to a pair of related problems that aris.. (shrink)

In this paper I formulate Minimal Requirements for Candidate Predictions in quantum field theories, inspired by viewing the standard model as an effective field theory. I then survey standard effective field theory regularization procedures, to see if the vacuum expectation value of energy density ) is a quantity that meets these requirements. The verdict is negative, leading to the conclusion that \ is not a physically significant quantity in the standard model. Rigorous extensions of flat space quantum field theory eliminate (...) \ from their conceptual framework, indicating that it lacks physical significance in the framework of quantum field theory more broadly. This result has consequences for problems in cosmology and quantum gravity, as it suggests that the correct solution to the cosmological constant problem involves a revision of the vacuum concept within quantum field theory. (shrink)

Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that each regular field is algebraically closed. Standard arguments show that a generically stable regular field is algebraically closed. LetKbe a regular field which is not generically stable and letpbe its global generic type. We observe that ifKhas a finite extensionLof degreen, thenPhas unbounded orbit (...) under the action of the multiplicative group ofL.Known to be true in the minimal context, it remains wide open whether regular, or even quasi-minimal, groups are abelian. We show that if it is not the case, then there is a counter-example with a unique nontrivial conjugacy class, and we notice that a classical group with one nontrivial conjugacy class is not quasi-minimal, because the centralizers of all elements are uncountable. Then, we construct a group of cardinality ω1with only one nontrivial conjugacy class and such that the centralizers of all nontrivial elements are countable. (shrink)

In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko —nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions, introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of κ -compactness. We are particularly interested (...) in non-topped intersection structures viewed as semi-lattices with a minimal meet-dense subset, i.e., with a minimal generator set. We study a chain condition which is sufficient for a minimal generator set, implies compactness of the logic, and in regular logics is equivalent to compactness of the consequence relation together with the existence of a inconsistent set, where κ is the cofinality of the cardinality of the logic. Some of these results are known in a similar form in the context of closure spaces, we give extensions to intersection structures and to big cardinals presenting new proofs based on set-theoretical tools. The existence of a minimal generator set is crucial for our way to define connectives. Although our method can be extended to further non-classical connectives we concentrate here on intuitionistic and infinite ones. Our approach leads us to the concept of the set of complete theories which is stable under all considered connectives and gives rise to the definition of the topological space of the logic. Topological representations of abstract logics by means of this space remain to be further investigated. (shrink)

We define a hierarchy on the regular types of an ω-stable nonmultidimensional theory, using generalised notions of algebraic and strongly minimal formulae. As an application we show that any resplendent model of an ω-stable finite-dimensional theory is saturated.

It is argued that one can learn from minimal economic models. Minimal models are models that are not similar to the real world, do not resemble some of its features, and do not adhere to accepted regularities. One learns from a model if constructing and analysing the model affects one’s confidence in hypotheses about the world. Economic models, I argue, are often assessed for their credibility. If a model is judged credible, it is considered to be a relevant possibility. Considering (...) such relevant possibilities may affect one’s confidence in necessity or impossibility hypotheses. Thus, one can learn from minimal economic models. (shrink)

A totally ordered group G is called coset-minimal if every definable subset of G is a finite union of cosets of definable subgroups intersected with intervals with endpoints in G{±∞}. Continuing work in Belegradek et al. 1115) and Point and Wagner 261), we study coset-minimality, as well as two weak versions of the notion: eventual and ultimate coset-minimality. These groups are abelian; an eventually coset-minimal group, as a pure ordered group, is an ordered abelian group of finite (...) class='Hi'>regular rank. Any pure ordered abelian group of finite regular rank is ultimately coset-minimal and has the exchange property; moreover, every definable function in such a group is piecewise linear. Pure coset-minimal and eventually coset-minimal groups are classified. In a discrete coset-minimal group every definable unary function is piece-wise linear 261), where coset-minimality of the theory of the group was required). A dense coset-minimal group has the exchange property ); moreover, any definable unary function is piecewise linear, except possibly for finitely many cosets of the smallest definable convex nonzero subgroup. Finally, we give some examples and open questions. (shrink)

We study regularity properties related to Cohen, random, Laver, Miller and Sacks forcing, for sets of real numbers on the Δ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_3}$$\end{document} level of the projective hieararchy. For Δ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_2}$$\end{document} and Σ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_2}$$\end{document} sets, the relationships between these properties follows the pattern of the well-known Cichoń diagram for cardinal characteristics of the continuum. It is known that (...) assuming suitable large cardinals, the same relationships lift to higher projective levels, but the questions become more challenging without such assumptions. Consequently, all our results are proved on the basis of ZFC alone or ZFC with an inaccessible cardinal. We also prove partial results concerning Σ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_3}$$\end{document} and Δ41\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_4}$$\end{document} sets. (shrink)

In the paper we analyse the problem of axiomatizing the minimal variant of discussive logic denoted as $$ {\textsf {D}}_{\textsf {0}}$$ D 0. Our aim is to give its axiomatization that would correspond to a known axiomatization of the original discussive logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2. The considered system is minimal in a class of discussive logics. It is defined similarly, as Jaśkowski’s logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2 but with the help of the deontic normal logic (...) $$\textbf{D}$$ D. Although we focus on the smallest discussive logic and its correspondence to $$ {\textsf {D}}_{\textsf {2}}$$ D 2, we analyse to some extent also its formal aspects, in particular its behaviour with respect to rules that hold for classical logic. In the paper we propose a deductive system for the above recalled discussive logic. While formulating this system, we apply a method of Newton da Costa and Lech Dubikajtis—a modified version of Jerzy Kotas’s method used to axiomatize $$ {\textsf {D}}_{\textsf {2}}$$ D 2. Basically the difference manifests in the result—in the case of da Costa and Dubikajtis, the resulting axiomatization is pure modus ponens-style. In the case of $$ {\textsf {D}}_{\textsf {0}}$$ D 0, we have to use some rules, but they are mostly needed to express some aspects of positive logic. $$ {\textsf {D}}_{\textsf {0}}$$ D 0 understood as a set of theses is contained in $$ {\textsf {D}}_{\textsf {2}}$$ D 2. Additionally, any non-trivial discussive logic expressed by means of Jaśkowski’s model of discussion, applied to any regular modal logic of discussion, contains $$ {\textsf {D}}_{\textsf {0}}$$ D 0. (shrink)

The main results in the paper are the following. Theorem A. Suppose that T is superstable and M ⊂ N are distinct models of T eq . Then there is a c ϵ N⧹M such that t is regular. For M ⊂ N two models we say that M ⊂ na N if for all a ϵ M and θ such that θ ≠ θ , there is a b ∈ θ ⧹ acl . Theorem B Suppose that T (...) is superstable , M ⊂ na N are models of T eq , and p is a regular type non-orthogonal to t . Then there is a c ϵ N such that t is regular and non-orthogonal to p. Furthermore, there is a formula θ ∈ t such that a ∈ θ and t ⊥ ̷ p ⇒ t is regular. We used these results to obtain ‘good’ tree decompositions of models in superstable theories with NDOP. See Definition 5.1 for the undefined terms. Theorem C Suppose that T is superstable with NDOP and M ⊨ T eq . Then every ⊂ na - decomposition inside M extends to a ⊂ na -decomposition of M. Furthermore, if 〈N η , a η : η ∈ I〉 is any ⊂ na -decomposition of M, then M is minimal over ∪N η and for all η ∈ I. M is dominated by ∪N η over N η . Using some stable group theory we show that when Th is superstable with NDOP and 〈 N η : η ∈ I 〉 is a tree decomposition of M, then M is constructible over ∪ n η with respect to a very strong isolation relation. (shrink)

Uncountable superperfect forcing is tree forcing on regular uncountable cardinals κ with κ<κ=κ, using trees in which the heights of nodes that split along any branch in the tree form a club set, and such that any node in the tree with more than one immediate extension has measure-one-many extensions, where the measure is relative to some κ-complete, nonprincipal normal filter F. This forcing adds a generic of minimal degree if and only if F is κ-saturated.

Ormerod and Chronicle reported that optimal solutions to traveling salesperson problems were judged to be aesthetically more pleasing than poorer solutions and that solutions with more convex hull nodes were rated as better figures. To test these conclusions, solution regularity and the number of potential intersections were held constant, whereas solution optimality, the number of internal nodes, and the number of nearest neighbors in each solution were varied factorially. The results did not support the view that the convex hull is (...) an important determinant of figural attractiveness. Also, in contrast to the findings of Ormerod and Chronicle, there were consistent individual differences. Participants appeared to be divided as to whether the most attractive figure enclosed a given area within a perimeter of minimum or maximum length. It is concluded that future research in this area cannot afford to focus exclusively on group performance measures. (shrink)

Examples from the sciences showing that mechanisms do not always succeed in producing the phenomena for which they are responsible have led some authors to conclude that the regularity requirement can be eliminated from characterizations of mechanisms. In this article, I challenge this conclusion and argue that a minimal form of regularity is inextricably embedded in examples of elucidated mechanisms that have been shown to be causally responsible for phenomena. Examples of mechanistic explanations from the sciences involve mechanisms that have (...) been shown to produce phenomena with a reproducible rate of success. By contrast, if phenomena are infrequent to the point that they amount to irreproducible observations and experimental results, they are indistinguishable from the background noise of accidental happenings. The inability to detect or measure the phenomenon of interest against the background noise of accidental correlations makes it impossible to elucidate a mechanism by experimental means, to demonstrate that a proposed mechanism actually produces the phenomenon, and ultimately to justify why a hypothetical scenario involving an irregular mechanism should be preferred over attributing irreproducible happenings to chance. (shrink)

We present a logic, $$\mathbf {ELI^r}$$ ELI r, for the discovery of deterministic causal regularities starting from empirical data. Our approach is inspired by Mackie’s theory of causes as INUS-conditions, and implements a more recent adjustment to Mackie’s theory according to which the left-hand side of causal regularities is required to be a minimal disjunction of minimal conjunctions. To derive such regularities from a given set of data, we make use of the adaptive logics framework. Our knowledge of deterministic causal (...) regularities is, as Mackie noted, most often gappy or elliptical. The adaptive logics framework is well-suited to explicate both the internal and the external dynamics of the discovery of such gappy regularities. After presenting $$\mathbf {ELI^r}$$ ELI r, we first discuss these forms of dynamics in more detail. Next, we consider some criticisms of the INUS-account and show how our approach avoids them, and we compare $$\mathbf {ELI^r}$$ ELI r with the CNA algorithm that was recently proposed by Michael Baumgartner. (shrink)

In this paper we study elimination of imaginaries in some classes of pure ordered abelian groups. For the class of ordered abelian groups with bounded regular rank (equivalently with finite spines) we obtain weak elimination of imaginaries once we add sorts for the quotient groups $\Gamma /\Delta $ for each definable convex subgroup $\Delta $, and sorts for the quotient groups $\Gamma /(\Delta + \ell \Gamma )$ where $\Delta $ is a definable convex subgroup and $\ell \in \mathbb {N}_{\geq (...) 2}$. We refer to these sorts as the quotient sorts. For the dp-minimal case we obtain a complete elimination of imaginaries if we also add constants to distinguish the cosets of $\ell \Gamma $ in $\Gamma $, where $\ell \in \mathbb {N}_{\geq 2}$. (shrink)

We present a logic, \, for the discovery of deterministic causal regularities starting from empirical data. Our approach is inspired by Mackie’s theory of causes as INUS-conditions, and implements a more recent adjustment to Mackie’s theory according to which the left-hand side of causal regularities is required to be a minimal disjunction of minimal conjunctions. To derive such regularities from a given set of data, we make use of the adaptive logics framework. Our knowledge of deterministic causal regularities is, as (...) Mackie noted, most often gappy or elliptical. The adaptive logics framework is well-suited to explicate both the internal and the external dynamics of the discovery of such gappy regularities. After presenting \, we first discuss these forms of dynamics in more detail. Next, we consider some criticisms of the INUS-account and show how our approach avoids them, and we compare \ with the CNA algorithm that was recently proposed by Michael Baumgartner. (shrink)

We consider definable topological spaces of dimension one in o-minimal structures, and state several equivalent conditions for when such a topological space \ \) is definably homeomorphic to an affine definable space with the induced subspace topology). One of the main results says that it is sufficient for X to be regular and decompose into finitely many definably connected components.

I analyze various natural assumptions which imply that the set {ω1L[x]∣x⊆ω}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{\omega_1^{L[x]} \mid x \subseteq \omega\}}$$\end{document} is stationary in ω1. The focal questions are which implications hold between them, what their consistency strengths are, and which large cardinal assumptions outright imply them.

This research was partially supported by Grant-in-Aid for Scientific Research (No. 06640178 and No. 06640336), Ministry of Education, Science and Culture of Japan Mathematics Subject Classification: 03E05 --> Abstract. Following Carr's study on diagonal operations and normal filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} in [2], several weakenings of normality have been investigated. One of them is to consider normal filters without \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness, for (...) example, see DiPrisco-Uzcategui [3]. The other is weakening normality itself while keeping \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness such as in Mignone [10] and Shioya [11]. We take the second one so that all filters are assumed to be \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-complete. In Sect. 1 a hierarchy of filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} is presented which corresponds to the length of diagonal intersections under which the filters are closed. It turns out that many ranks exist between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $FSF_{\kappa\lambda}$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $CF_{\kappa\lambda}$\end{document}. We consider seminormal ideals in Sect. 2 and determine the minimal seminormal ideal extending Johnson's result in [6]. Its precise descripti on changes according to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $cf(\lambda )$\end{document} although we can write it in a single form as well. We also prove that a nonnormal seminormal ideal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $I\supset NS_{\kappa\lambda}$\end{document} exists if and only if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\lambda$\end{document} is regular. (shrink)

We develop a mathematical theory for comparative sorites, considered in terms of a system mapping pairs of stimuli into a binary response characteristic whose values supervene on stimulus pairs and are interpretable as the complementary relations 'are the same' and 'are not the same' (overall or in some respect). Comparative sorites is about hypothetical sequences of stimuli in which every two successive elements are mapped into the relation 'are the same', while the pair comprised of the first and the last (...) elements of the sequence is mapped into 'are not the same'. Although soritical sequences of this kind are logically possible, we argue that their existence is grounded in no empirical evidence and show that it is excluded by a certain psychophysical principle proposed for human comparative judgements in a context unrelated to soritical issues. We generalize this principle to encompass all conceivable situations for which comparative sorites can be formulated. (shrink)

Machine learning operates at the intersection of statistics and computer science. This raises the question as to its underlying methodology. While much emphasis has been put on the close link between the process of learning from data and induction, the falsificationist component of machine learning has received minor attention. In this paper, we argue that the idea of falsification is central to the methodology of machine learning. It is commonly thought that machine learning algorithms infer general prediction rules from past (...) observations. This is akin to a statistical procedure by which estimates are obtained from a sample of data. But machine learning algorithms can also be described as choosing one prediction rule from an entire class of functions. In particular, the algorithm that determines the weights of an artificial neural network operates by empirical risk minimization and rejects prediction rules that lack empirical adequacy. It also exhibits a behavior of implicit regularization that pushes hypothesis choice toward simpler prediction rules. We argue that taking both aspects together gives rise to a falsificationist account of artificial neural networks. (shrink)

Minimally, causal realism (as understood here) is the view that accounts of causation in terms of mere, regular or probabilistic conjunction are unsatisfactory, and that causal phenomena are correctly associated with some form of de re necessity. Classic arguments, however, some of which date back to Sextus Empiricus and have appeared many times since, including famously in Russell, suggest that the very notion of causal realism is incoherent. In this paper I argue that if such objections seem compelling, it (...) is only because everyday expressions concerning causal phenomena are misleading with respect to certain metaphysical details. These expressions generally make reference to the relations of events or states of affairs, but ignore or obscure the role played by causal properties. I argue that on a proposed alternative, an analysis in terms of causal processes, more refined descriptions of causal phenomena escape the charge of incoherence. Causal necessity is here located in the relations of causal properties. I distinguish this view from the recent process theories of Salmon and Dowe, which are disinterested in causal realism. (shrink)

Most defenders of the new mechanistic approach accept ontic constraints for successful scientific explanation (Illari 2013; Craver 2014). The minimal claim is that scientific explanations have objective truthmakers, namely mechanisms that exist in the physical world independently of any observer and that cause or constitute the phenomena-to- be-explained. How can this idea be applied to type-level explanations? Many authors at least implicitly assume that in order for mechanisms to be the truthmakers of type-level explanation they need to be regular (...) (Andersen 2012; Sheredos 2015). One problem of this assumption is that most mechanisms are (highly) stochastic in the sense that they “fail more often than they succeed” (Bogen 2005; Andersen 2012). How can a mechanism type whose instances are more likely not to produce an instance of a particular phenomenon type be the truthmaker of the explanation of that particular phenomenon type? In this paper, I will give an answer to this question. I will analyze the notion of regularity and I will discuss Andersen's suggestion for how to cope with stochastic mechanisms. I will argue that her suggestion cannot account for all kinds of stochastic mechanisms and does not provide an answer as to why regularity grounds type-level explanation. According to my analysis, a mechanistic type- level explanation is true if and only if at least one of the following two conditions is satisfied: the mechanism brings about the phenomenon more often than any other phenomenon (comparative regularity) or the phenomenon is more often brought about by the mechanism than by any other mechanism/causal sequence (comparative reverse regularity). (shrink)

Lawmakers regularly delegate authority to agents. Such delegation is accompanied by mechanisms that attempt to ensure that the agents adhere to the will of the lawmakers. But these mechanisms are often ineffective or inefficient. Moreover, at times the very imposition of constraints distorts the agents’ incentives and impels them to adopt skewed policies. We suggest that it is possible to reduce such wasteful enforcement costs by delegating authority to certain types of agents who will pursue the lawmaker’s policies without constraints (...) imposed by the lawmaker. In this Article we focus on agents who are impartial — but not indifferent! — and skillful enough to identify the proper course of action. The Article encompasses two main arguments. The normative argument is that when skillful and impartial agents can be identified, it makes sense to delegate to them decision-making powers with only limited constraints. Moreover, in such instances it may be more cost-effective to provide agents with incentives to act impartially rather than develop enforcement mechanisms to impose impartiality. The positive argument is that the law — sometimes explicitly and sometimes implicitly — is compatible with our normative argument in various fields. Although our argument is general in scope and applies to many areas of law, in this Article we begin by focusing on tort law and on international law. We distinguish five categories of cases where the law relies on agents and detect in some of them impartial and skillful agents. This analysis demonstrates that, in some of these categories, the law in fact relies on agents with only minimal constraints and that, in other situations, the constraints imposed by the law are counterproductive. Our normative argument thus serves an explanatory role in understanding many legal doctrines and principles, but, at the same time, offers a critical view on other doctrines and principles, which are not compatible with that argument. (shrink)

Kleene algebras and action logic were proposed to be solutions to the finite axiomatization problem of the algebra of regular sets (of strings). They are treated here as nonclassical logics—with Hilbert-style axiomatizations and semantics. We also provide intuitive accounts in terms of information states of the semantics which provide further insights into the formalisms. The three types of "Kripke-style'' semantics which we define develop insights from gaggle theory, and from our four-valued and generalized Kripke semantics for the minimal substructural (...) logic. Soundness and completeness are proven each time. (shrink)

An interdisciplinary account of phenomenal unity, investigating how experiential wholes can be characterized and how such characterizations can be analyzed computationally. How can we account for phenomenal unity? That is, how can we characterize and explain our experience of objects and groups of objects, bodily experiences, successions of events, and the attentional structure of consciousness as wholes? In this book, Wanja Wiese develops an interdisciplinary account of phenomenal unity, investigating how experiential wholes can be characterized and how such characterization can (...) be analyzed conceptually as well as computationally. Wiese first addresses how the unity of consciousness can be characterized phenomenologically, discussing what it is like to experience wholes and what is the experiential contribution of phenomenal unity. Considering the associated conceptual and empirical issues, he draws connections to phenomenological accounts and research on Gestalt theory. The results show how the attentional structure of experience, the experience of temporal flow, and different types of experiential wholes contribute to our sense of phenomenal unity. Moreover, characterizing phenomenal unity in terms of the existence of a single global phenomenal state is neither necessary nor sufficient to adequately address the problem of phenomenal unity. Wiese then suggests that the concepts and ideas of predictive processing can be used to analyze phenomenal unity computationally. The result is both a conceptual framework and an interdisciplinary account: the regularity account of phenomenal unity. According to this account, experienced wholes correspond to a hierarchy of connecting regularities. The brain tracks these regularities by hierarchical prediction error minimization, which approximates hierarchical Bayesian inference. (shrink)

Call a (strictly increasing) sequence (rn) of natural numbers regular if it satisfies the following condition: rn+1/rn→θ∈R>1∪{∞} and, if θ is algebraic, then (rn) satisfies a linear recurrence relation whose characteristic polynomial is the minimal polynomial of θ. Our main result states that (Z,+,0,R) is superstable whenever R is enumerated by a regular sequence. We give two proofs of this result. One relies on a result of E. Casanovas and M. Ziegler and the other on a quantifier elimination (...) result. We also show that (Z,+,0,<,R) is NIP whenever R is enumerated by a regular sequence that is ultimately periodic modulo m for all m>1. (shrink)

We prove that the zero-set of a C ∞ function belonging to a noetherian differential ring M can be written as a finite union of C ∞ manifolds which are definable by functions from the same ring. These manifolds can be taken to be connected under the additional assumption that every zero-dimensional regular zero-set of functions in M consists of finitely many points. These results hold not only for C ∞ functions over the reals, but more generally for definable (...) C ∞ functions in a definably complete expansion of an ordered field. The class of definably complete expansions of ordered fields, whose basic properties are discussed in this paper, expands the class of real closed fields and includes o-minimal expansions of ordered fields. Finally, we provide examples of noetherian differential rings of C ∞ functions over the reals, containing non-analytic functions. (shrink)

In Arrovian social choice theory assuming the independence of irrelevant alternatives, Murakami (1968) proved two theorems about complete and transitive collective choice rules that satisfy strict non-imposition (citizens’ sovereignty), one being a dichotomy theorem about Paretian or anti-Paretian rules and the other a dictator-or-inverse-dictator impossibility theorem without the Pareto principle. It has been claimed in the later literature that a theorem of Malawski and Zhou (1994) is a generalization of Murakami’s dichotomy theorem and that Wilson’s (1972) impossibility theorem is stronger (...) than Murakami’s impossibility theorem, both by virtue of replacing Murakami’s assumption of strict non-imposition with the assumptions of non-imposition and non-nullness. In this note, we first point out that these claims are incorrect: non-imposition and non-nullness are together equivalent to strict non-imposition for all transitive collective choice rules. We then generalize Murakami’s dichotomy and impossibility theorems to the setting of incomplete social preference. We prove that if one drops completeness from Murakami’s assumptions, his remaining assumptions imply (i) that a collective choice rule is either Paretian, anti-Paretian, or dis-Paretian (unanimous individual preference implies noncomparability) and (ii) that adding proposed constraints on noncomparability, such as the regularity axiom of Eliaz and Ok (2006), restores Murakami’s dictator-or-inverse-dictator result. (shrink)

Even though researchers regularly use neutral affect induction procedures as a control condition in their work, there is little consensus on what is neutral affect. This article reviews five approaches that researchers have used to operationalize neutral AIPs: to produce a minimal affective state, in-the-middle state, deactivated state, typical state, or indifferent state. For each view, the article delineates the theoretical basis for the neutral AIP, how to assess it, and provides recommendations for when and how to use it. The (...) goal of the article is to encourage researchers to state their theoretical assumptions about neutral affect, to validate those assumptions, and to make appropriate conclusions based on them. (shrink)

Polysemy has recently emerged as a popular topic in philosophy of language. While much existing research focuses on the relatedness among senses, this article introduces a novel perspective that emphasizes the continuity of sense individuation, sense regularity, and sense productivity. This new perspective has only recently gained traction, largely due to advancements in computational linguistics. It also poses a serious challenge to semantic minimalism, so I present three arguments against minimalism from the continuous perspective that touch on the minimal concept, (...) the distinction from homonymy, and the quasi‐rule‐like nature of polysemy. Last, I provide an account of polysemy that incorporates this continuous perspective. (shrink)

Some subfamilies of κ, for κ regular, κ λ, called -semimorasses are investigated. For λ = κ+, they constitute weak versions of Velleman's simplified -morasses, and for λ > κ+, they provide a combinatorial framework which in some cases has similar applications to the application of -morasses with this difference that the obtained objects are of size λ κ+, and not only of size κ+ as in the case of morasses. New consistency results involve existence of nonreflecting objects of (...) singular sizes of uncountable cofinality such as a nonreflecting stationary set in κ, a nonreflecting nonmetrizable space of size λ, a nonreflecting nonspecial tree of size λ. We also characterize possible minimal sizes of nonspecial trees without uncountable branches. (shrink)

Given a regular cardinal κ > ω1 and a cardinal λ with κ ≤ cf (λ) < λ, we show that NSκ,λ | T is not λ+-saturated, where T is the set of all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${a\in P_\kappa (\lambda)}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${| a | = | a \cap \kappa|}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm cf} \big( {\rm sup} (...) (a\cap\kappa)\big) = {\rm cf} \big({\rm sup} (a)\big) = \omega}$$\end{document}. (shrink)

According to one large family of views, scientific explanations explain a phenomenon (such as an event or a regularity) by subsuming it under a general representation, model, prototype, or schema (see Bechtel, W., & Abrahamsen, A. (2005). Explanation: A mechanist alternative. Studies in History and Philosophy of Biological and Biomedical Sciences, 36(2), 421–441; Churchland, P. M. (1989). A neurocomputational perspective: The nature of mind and the structure of science. Cambridge: MIT Press; Darden (2006); Hempel, C. G. (1965). Aspects of scientific (...) explanation. In C. G. Hempel (Ed.), Aspects of scientific explanation (pp. 331–496). New York: Free Press; Kitcher (1989); Machamer, P., Darden, L., & Craver, C. F. (2000). Thinking about mechanisms. Philosophy of Science, 67(1), 1–25). My concern is with the minimal suggestion that an adequate philosophical theory of scientific explanation can limit its attention to the format or structure with which theories are represented. The representational subsumption view is a plausible hypothesis about the psychology of understanding. It is also a plausible claim about how scientists present their knowledge to the world. However, one cannot address the central questions for a philosophical theory of scientific explanation without turning one’s attention from the structure of representations to the basic commitments about the worldly structures that plausibly count as explanatory. A philosophical theory of scientific explanation should achieve two goals. The first is explanatory demarcation. It should show how explanation relates with other scientific achievements, such as control, description, measurement, prediction, and taxonomy. The second is explanatory normativity. It should say when putative explanations succeed and fail. One cannot achieve these goals without undertaking commitments about the kinds of ontic structures that plausibly count as explanatory. Representations convey explanatory information about a phenomenon when and only when they describe the ontic explanations for those phenomena. (shrink)

If a˜cardinal κ1, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ0 and its new cofinality, ρ, is less than κ0, then, under some additional assumptions, each cardinal λ>κ1 less than cc/[κ1]<κ1) is collapsed to κ0 as well. If in addition N=M[f], where f : ρ→κ1 is an unbounded mapping, then N is a˜λ=κ0-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.

Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto (...) nowhere dense sets. If 2< κ =κ, then in each generic extension of V, in which κ is the minimal cardinal obtaining new subsets, some mad family on κ is killed or an independent subset of κ appears. Also, the κ-Suslin Hypothesis holds iff there exists a mad family on κ which is killed in each generic extension containing new subsets of κ and preserving P(λ) for λ<κ. (shrink)

Social norms are commonly understood as rules that dictate which behaviors are appropriate, permissible, or obligatory in different situations for members of a given community. Many researchers have sought to explain the ubiquity of social norms in human life in terms of the psychological mechanisms underlying their acquisition, conformity, and enforcement. Existing theories of the psychology of social norms appeal to a variety of constructs, from prediction-error minimization, to reinforcement learning, to shared intentionality, to domain-specific adaptations for norm acquisition. In (...) this paper, we propose a novel methodological and conceptual framework for the cognitive science of social norms that we call normative pluralism. We begin with an analysis of the explanatory aims of the cognitive science of social norms. From this analysis, we derive a recommendation for a reformed conception of its explanandum: a minimally psychological construct that we call normative regularities. Our central empirical proposal is that the psychological underpinnings of social norms are most likely realized by a heterogeneous set of cognitive, motivational, and ecological mechanisms that vary between norms and between individuals, rather than by a single type of process or distinctive norm system. This pluralistic approach, we suggest, offers a methodologically sound point of departure for a fruitful and rigorous science of social norms. (shrink)

Geologists, Paleontologists and other historical scientists are frequently concerned with narrative explanations targeting single cases. I show that two distinct explanatory strategies are employed in narratives, simple and complex. A simple narrative has minimal causal detail and is embedded in a regularity, whereas a complex narrative is more detailed and not embedded. The distinction is illustrated through two case studies: the ‘snowball earth’ explanation of Neoproterozoic glaciation and recent attempts to explain gigantism in Sauropods. This distinction is revelatory of historical (...) science. I argue that at least sometimes which strategy is appropriate is not a pragmatic issue, but turns on the nature of the target. Moreover, the distinction reveals a counterintuitive pattern of progress in some historical explanation: shifting from simple to complex. Sometimes, historical scientists rightly abandon simple, unified explanations in favour of disunified, complex narratives. Finally I compare narrative and mechanistic explanation, arguing that mechanistic approaches are inappropriate for complex narrative explanations. (shrink)

This paper discusses the constitution relation within the framework of the mechanistic approach to neurobiological explanation. It develops a regularity theory of constitution as an alternative to the manipulationist theory of constitution advocated by some of the proponents of the mechanistic approach. After the main problems of the manipulationist account of constitution have been reviewed, the regularity account is developed based on the notion of a minimal type relevance theory. A minimal type relevance theory expresses a minimally necessary condition of (...) a given type that consists of a disjunction of minimally sufficient conditions of that type. Afterwards, the attained definition is successfully applied in an analysis of the logical structure of the explanation of spatial learning and memory in rats as a paradigm neurobiological explanation. The overall result is a more robust and more precise version of the mechanistic approach to neurobiological explanations. (shrink)

Fodor and Pylyshyn's critique of connectionism has posed a challenge to connectionists: Adequately explain such nomological regularities as systematicity and productivity without postulating a "language of thought" (LOT). Some connectionists like Smolensky took the challenge very seriously, and attempted to meet it by developing models that were supposed to be non-classical. At the core of these attempts lies the claim that connectionist models can provide a representational system with a combinatorial syntax and processes sensitive to syntactic structure. They are not (...) implementation models because, it is claimed, the way they obtain syntax and structure sensitivity is not "concatenative," hence "radically different" from the way classicists handle them. In this paper, I offer an analysis of what it is to physically satisfy/realize a formal system. In this context, I examine the minimal truth-conditions of LOT Hypothesis. From my analysis it will follow that concatenative realization of formal systems is irrelevant to LOTH since the very notion of LOT is indifferent to such an implementation level issue as concatenation. I will conclude that to the extent to which they can explain the law-like cognitive regularities, a certain class of connectionist models proposed as radical alternatives to the classical LOT paradigm will in fact turn out to be LOT models, even though new and potentially very exciting ones. (shrink)