Post in 1944 began studying properties of a computably enumerable set A such as simple, h-simple, and hh-simple, with the intent of finding a property guaranteeing incompleteness of A . From the observations of Post and Myhill , attention focused by the 1950s on properties definable in the inclusion ordering of c.e. subsets of ω, namely E = . In the 1950s and 1960s Tennenbaum, Martin, Yates, Sacks, Lachlan, Shoenfield and others produced a number of elegant results relating ∄-definable (...) properties of A , like maximal, hh-simple, atomless, to the information content of A . Harrington and Soare gave an answer to Post's program for definable properties by producing an ∄-definable property Q which guarantees that A is incomplete and noncomputable, but developed a new Δ 3 0 -automorphism method to prove certain other properties are not ∄-definable. In this paper we introduce new ∄-definable properties relating the ∄-structure of A to deg, which answer some open questions. In contrast to Q we exhibit here an ∄-definable property T which allows such a rapid flow of elements into A that A must be complete even though A may possess many other properties such as being promptly simple. We also present a related property NL which has a slower flow but fast enough to guarantee that A is not low, even though A may possess virtually all other related lowness properties and A may simultaneously be promptly simple. (shrink)

We introduce a natural class of quantifiersTh containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic ofL ωω (Th) or countably compact regular sublogic ofL ∞ω (Th), properly extendingL ωω , satisfies the uniform reduction property for quotients. As a consequence, none of these logics satisfies eitherΔ-interpolation or Beth's definability theorem when closed under relativizations. We also show the failure of both properties for any sublogic (...) ofL ∞ω (Th) in which Chang's quantifier or some cardinality quantifierQ α, with α≧1, is definable. (shrink)

In this paper it will be shown that the Beth definability property corresponds to surjectiveness of epimorphisms in abstract algebraic logic. This generalizes a result by I. Németi (cf. [11, Theorem 5.6.10]). Moreover, an equally general characterization of the weak Beth property will be given. This gives a solution to Problem 14 in [20]. Finally, the characterization of the projective Beth property for varieties of modal algebras by L. Maksimova (see [15]) will be shown to hold for (...) the larger class of semantically algebraizable logics. (shrink)

We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of Felix Klein's Erlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and the Martin Invariance Conjecture on their Turing degrees, i.e., their information content with respect to relative computability (Turing reducibility).

In [E. Hrushovski, D. Palacín and A. Pillay, On the canonical base property, Selecta Math. (N.S.) 19(4) (2013) 865–877], Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that [Formula: see text] has the canonical base property in a strong form; “internality to” being replaced by “algebraicity in”. In the current paper, we give a reasonably robust definition of the “strong canonical base property” in a rather more general (...) finite rank context than [E. Hrushovski, D. Palacín and A. Pillay, On the canonical base property, Selecta Math. (N.S.) 19(4) (2013) 865–877], and prove its equivalence with rigidity of the relevant definable Galois groups. The new direction is an elaboration on the old result that [Formula: see text]-based groups are rigid. (shrink)

The aim of this paper is to provide a systematic account of the metaphysically important distinction between haecceitistic properties, such as being David Lewis or being acquainted with David Lewis, and qualitative properties, such as being red or being acquainted with a famous philosopher. I first argue that this distinction is hyperintensional, that is, that cointensional properties can differ in whether they are qualitative. Then I develop an analysis of the qualitative/haecceitistic distinction according to which haecceitistic properties are relational in (...) a certain sense. I argue that this analysis can capture the hyperintensionality of the qualitative/haecceitistic distinction and is generally in accordance with the use of the notion of a qualitative property in philosophical debates. (shrink)

We prove that there exists no sentence F of the language of rings with an extra binary predicat I2 satisfying the following property: for every definable set X ⊆ ℂ2, X is connected if and only if ⊧ F, where I2 is interpreted by X. We conjecture that the same result holds for closed subset of ℂ2. We prove some results motivated by this conjecture.

We obtain some new results on the topology of unary definable sets in expansions of densely ordered Abelian groups of burden 2. In the special case in which the structure has dp‐rank 2, we show that the existence of an infinite definable discrete set precludes the definability of a set which is dense and codense in an interval, or of a set which is topologically like the Cantor middle‐third set (Theorem 2.9). If it has burden 2 and both an infinite (...) discrete set D and a dense‐codense set X are definable, then translates of X must witness the Independence Property (Theorem 2.26). In the last section, an explicit example of an ordered Abelian group of burden 2 is given in which both an infinite discrete set and a dense‐codense set are definable. (shrink)

Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T{“σ is an automorphism”} is an elementary class if and only if T has the definable multiplicity property, as long as T is a finite cover of a strongly minimal theory which does have the definable multiplicity property. We obtain cleaner results working with several automorphisms, and prove: the class of existentially closed models of T{“σi is an automorphism”: (...) i=1,2} is an elementary class if and only if T has the definable multiplicity property. (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)

Intuitively, a property is intrinsic just in case a thing’s having it (at a time) depends only on what that thing is like (at that time), and not on what any wholly distinct contingent object (or wholly distinct time) is like. A property is extrinsic just in case it is non-intrinsic. Redness and squareness are intrinsic properties. Being next to a red object is extrinsic.

The Converse Ackermann Property is the unprovability of formulas of the form (A -> B) -> C when C does contain neither -> nor ¬. Intuitively, the CAP amounts to rule out the derivability of pure non-necessitive propositions from non-necessitive ones. A constructive negation of the sort historically defined by, e.g., Johansson is added to positive logics with the CAP in the spectrum delimited by Ticket Entailment and Dummett’s logic LC.

We discuss the externally definable Ramsey property, a weakening of the Ramsey property for relational structures, where the only colourings considered are those that are externally definable: that is, definable with parameters in an elementary extension. We show a number of basic results analogous to the classical Ramsey theory, and show that, for an ultrahomogeneous structure M with countable age, the externally definable Ramsey property is equivalent to the dynamical statement that, for all $$n \in \mathbb {N} (...) $$, every subflow of the space $$S_n(M)$$ of n-types has a fixed point. We discuss a range of examples, including results regarding the lexicographic product of structures. (shrink)

There are, broadly, three sorts of account of intrinsicality: ‘self-sufficiency’, ‘essentiality’ and ‘pure qualitativeness’. I argue for the last of these, and urge that we take intrinsic properties of concrete objects to be all and only those shared by actual or possible duplicates, which only differ extrinsically. This approach gains support from Francescotti’s approach: defining ‘intrinsic’ in contradistinction to extrinsic properties which ‘consist in’ relations which rule out intrinsicality. I answer Weatherson’s criticisms of Francescotti, but, to answer criticisms of (...) my own, I amend his account, proposing that possession of an extrinsic property consists in a relation to one or more actual or possible distinct concrete objects. Finally I indicate ways to avoid some apparent objections to this account. (shrink)

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)

The following two assertions are equivalent for an o-minimal expansion of an ordered group $$\mathcal M=(M,<,+,0,\ldots )$$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous function $$f:A \rightarrow M$$ defined on a definable closed subset of $$M^n$$ has a definable continuous extension $$F:M^n \rightarrow M$$.

An intrinsic property, according to one important account, is a property that is had by all of one's duplicates. Instead, one might choose to characterize intrinsic properties as those that can be had in the absence of all distinct individuals. After reviewing the problems with these earlier accounts, the author presents a less problematic analysis. The goal is to clarify the rough idea that an intrinsic property is a special sort of non-relational property; having the (...) class='Hi'>property does not consist in any relation one bears to distinct individuals. (shrink)

In this paper we prove the equiconsistency of "Every ω 1 -tree which is first order definable over (H ω 1 ·ε) has a cofinal branch" with the existence of a Π 1 1 reflecting cardinal. We also prove that the addition of MA to the definable tree property increases the consistency strength to that of a weakly compact cardinal. Finally we comment on the generalization to higher cardinals.

The Stone-Weierstrass Theorem for compact Hausdorff spaces is a basic result of functional analysis with far-reaching consequences. We introduce an equational logic ⊨Δ associated with an infinitary variety Δ and show that the Stone-Weierstrass Theorem is a consequence of the Beth definability property of ⊨Δ, stating that every implicit definition can be made explicit. Further, we define an infinitary propositional logic ⊢Δ by means of a Hilbert-style calculus and prove a strong completeness result whereby the semantic notion of consequence (...) associated with ⊢Δ coincides with ⊨Δ. (shrink)

A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class. K is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed (...) by the taxonomy. A space X in K is characterized within the classification scheme if whenever Y ∈ K and Y is equivalent to X, then Y is homeomorphic to X. As prime example, the closed set taxonomy assigns to each sentence in the first order language of bounded lattices the class of topological spaces whose lattices of closed sets satisfy that sentence. It turns out that every compact two-complex is characterized via this taxonomy in the class of metrizable spaces, but that no infinite discrete space is so characterized. We investigate various natural classification schemes, compare them, and look into the question of which spaces can and cannot be characterized within them. (shrink)

I want to motivate an account of what it is for an object to have a property, which may as well be called a deflationary view about properties. Such a view follows from a conception of predication I ground in the work of Donald Davidson, some of which remains unpublished. I claim that if we take seriously Davidson’s account of predication, by maintaining that sentences are the primary linguistic unit, we can define properties in terms of predicates. The aim (...) of this paper is twofold. First, I argue that this account is present in Davidson’s systematic treatment of the problem of predication. Second, I claim that this account is serviceable and economical, as it can accommodate a wide scope of properties and abstract objects without appealing to entities such as truthmakers or joints in nature. (shrink)

We investigate the general properties of general Bayesian learning, where “general Bayesian learning” means inferring a state from another that is regarded as evidence, and where the inference is conditionalizing the evidence using the conditional expectation determined by a reference probability measure representing the background subjective degrees of belief of a Bayesian Agent performing the inference. States are linear functionals that encode probability measures by assigning expectation values to random variables via integrating them with respect to the probability measure. If (...) a state can be learned from another this way, then it is said to be Bayes accessible from the evidence. It is shown that the Bayes accessibility relation is reflexive, antisymmetric and non-transitive. If every state is Bayes accessible from some other defined on the same set of random variables, then the set of states is called weakly Bayes connected. It is shown that the set of states is not weakly Bayes connected if the probability space is standard. The set of states is called weakly Bayes connectable if, given any state, the probability space can be extended in such a way that the given state becomes Bayes accessible from some other state in the extended space. It is shown that probability spaces are weakly Bayes connectable. Since conditioning using the theory of conditional expectations includes both Bayes’ rule and Jeffrey conditionalization as special cases, the results presented generalize substantially some results obtained earlier for Jeffrey conditionalization. (shrink)

In any model theoretic logic, Beth’s definability property together with Feferman-Vaught’s uniform reduction property for pairs imply recursive compactness, and the existence of models with infinitely many automorphisms for sentences having infinite models. The stronger Craig’s interpolation property plus the uniform reduction property for pairs yield a recursive version of Ehrenfeucht-Mostowski’s theorem. Adding compactness, we obtain the full version of this theorem. Various combinations of definability and uniform reduction relative to other logics yield corresponding results on (...) the existence of non-rigid models. (shrink)

To define new property terms, we combine already familiar ones by means of certain logical operations. Given suitable constraints, these operations may presumably include the resources of first-order logic: truth-functional sentence connectives and quantification over objects. What is far less clear is whether we can also use modal operators for this purpose. This paper clarifies what is involved in this question, and argues in favor of modal property definitions.

In this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called "uniform definability of types over finite sets" (UDTFS). We explore UDTFS and show how it relates to well-known properties in model theory. We recall that stable theories and weakly o-minimal theories have UDTFS and UDTFS implies dependence. We then show that all dp-minimal theories have UDTFS.

If there is a specifically rhetorical approach to argumentation, I believe it is one that studies argumentation that is specifically rhetorical. So if we want to ask, “What is the rhetorical approach to argumentation?” we should first ask, “What is rhetorical argumentation?” It is worthwhile focusing on this question because various misleading definitions of rhetorical argumentation have been in circulation for almost as long as rhetoric has existed. Some misleading definitions see the defining property of rhetorical argumentation in (...) the arguer’s aim. And that aim, which is often assumed to override all the arguer’s other considerations, is strategic: to persuade his hearer(s) by any available means and .. (shrink)

This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definability to arbitrary logics, formalised as institutions, and we develop three general definability results. One generalises the classical Beth theorem by relying on the interpolation properties of the institution. Another relies on a meta Birkhoff axiomatizability property of the institution and constitutes a source for many new actual definability (...) results, including definability in (fragments of) classical model theory. The third one gives a set of sufficient conditions for 'borrowing' definability properties from another institution via an 'adequate' encoding between institutions. The power of our general definability results is illustrated with several applications to (many-sorted) classical model theory and partial algebra, leading for example to definability results for (quasi-)varieties of models or partial algebras. Many other applications are expected for the multitude of logical systems formalised as institutions from computing science and logic. (shrink)

Orthodoxy has it that only metaphysically elite properties can be invoked in scientifically elite laws. We argue that this claim does not fit scientific practice. An examination of candidate scientifically elite laws like Newton’s F = ma reveals properties invoked that are irreversibly defined and thus metaphysically non-elite by the lights of the surrounding theory: Newtonian acceleration is irreversibly defined as the second derivative of position, and Newtonian resultant force is irreversibly defined as the sum of the component forces. We (...) think that scientists are happy to invoke metaphysically non-elite properties in scientifically elite laws for reasons of convenience, such as to simplify the equations and to make them more modular. On this basis, we draw a deflationary moral about laws themselves, as being merely convenient summaries. 1 Introduction2 Orthodoxy2.1 Orthodoxy stated2.2 Orthodoxy explained2.3 A worrisome commitment: Term objectivism3 The Loose View3.1 The argument from practice3.2 Finding the scientifically elite equations3.3 Diagnosing the metaphysically non-elite properties3.4 Situating our challenge4 Newtonian Mechanics4.1 Newtonian acceleration4.2 Newtonian resultant force4.3 A metaphysical discovery?5 Objections5.1 Metaphysically elite after all?5.2 Scientifically non-elite after all?5.3 But our world is not Newtonian!6 Consequences6.1 Consequences for the motivations for link6.2 Consequences for metaphysically elite properties6.3 Consequences for lawhood. (shrink)

We define a property R(A 0 , A 1 ) in the partial order E of computably enumerable sets under inclusion, and prove that R implies that A 0 is noncomputable and incomplete. Moreover, the property is nonvacuous, and the A 0 and A 1 which we build satisfying R form a Friedberg splitting of their union A, with A 1 prompt and A promptly simple. We conclude that A 0 and A 1 lie in distinct orbits under (...) automorphisms of E, yielding a strong answer to a question previously explored by Downey, Stob, and Soare about whether halves of Friedberg splittings must lie in the same orbit. (shrink)

A family of prepositional logics is considered to be intermediate between the intuitionistic and classical ones. The generalized interpolation property is defined and proved is the following.Theorem on interpolation. For every intermediate logic L the following statements are equivalent:(i) Craig's interpolation theorem holds in L, (ii) L possesses the generalized interpolation property, (iii) Robinson's consistency statement is true in L.

The redefinition of rights of equality and liberty by radical and deliberative democrats during the last decades of the 20th century resulted in the denial that a consideration of property is integral to political philosophy. Theorizing property as intrinsically political demands a return to Marx but on terms he may not have recognized. I outline a politics of property in this paper contending that there can be no universal justification for any regime of property. Property (...) is by definition the institution of a wrong. The articulation of something as property establishes a border, determining what can be owned, how far ownership extends, where it is limited, as well as terms of use and terms of abuse. It establishes a set of property relations, and defines a vocabulary of the proper. Here sovereign state power is enlisted to enforce relations of property beneficial to some, but not all. A challenge to any political regime must of necessity put in to question both the forms of proper behaviour, and the regime of property. These are intrinsically related to each other. I conclude by arguing that democracy is always improper. Property, in all of its forms entails enclosure. Enclosure requires the drawing and the maintenance of boundaries of exclusion and inclusion. The sovereign determination of the proper, as well as of the exception to the proper defines trespass. Trespass is a form of democratic enactment when, and if, it destabilises enclosure. (shrink)

The guarded fragment (GF) was introduced by Andréka, van Benthem and Németi as a fragment of first order logic which combines a great expressive power with nice, modal behavior. It consists of relational first order formulas whose quantifiers are relativized by atoms in a certain way. Slightly generalizing the admissible relativizations yields the packed fragment (PF). In this paper we investigate interpolation and definability in these fragments. We first show that the interpolation property of first order logic fails in (...) restriction to GF and PF. However, each of these fragments turns out to have an alternative interpolation property that closely resembles the interpolation property usually studied in modal logic. These results are strong enough to entail the Beth definability property for GF and PF. Even better, every guarded or packed finite variable fragment has the Beth property. For interpolation, we characterize exactly which finite variable fragments of GF and PF enjoy this property. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We show that every definable nested family of closed and bounded subsets of a P-minimal field K has nonempty intersection. As an application we answer a question of Darnière and Halupczok showing that P-minimal fields satisfy the “extreme value property”: for every closed and bounded subset [math] and every interpretable continuous function [math] (where [math] denotes the value group), f(U) admits a maximal value. Two further corollaries are obtained as (...) a consequence of their work. The first one shows that every interpretable subset of [math] is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every P-minimal field is polynomially bounded. The second one characterizes those P-minimal fields satisfying a classical cell preparation theorem as those having definable Skolem functions, generalizing a result of Mourgues. (shrink)

We investigate separation properties for neighbourhood spaces in some details within a framework of constructive mathematics, and define corresponding separation properties for quasi-apartness spaces. We also deal with separation properties for spaces with inequality.