In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and applies it to (...) constructive investigations of variants of determinacy statements for those games in which the players make choices from only finitely many alternatives. As a result, three formulations of open determinacy, that are all classically equivalent with each other, are equivalent to three different semi-classical principles, namely Markov’s Principle, Lesser Limited Principle of Omniscience and Limited Principle of Omniscience, over a suitable constructive base theory that proves clopen determinacy. Open and clopen determinacies for these games are thus separated. Some basic results on variants of inductive definitions for \ positive operators will also be given. (shrink)

In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as $\mathsf {P}\neq \mathsf {NP}$ [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of this kind had (...) been proved in [20, 22].In this paper, we generalize and strengthen these results. Another question that we address concerns the dependence between these conjectures. We construct two oracles that enable us to answer questions about relativized separations asked in [19, 25] (i.e., for the pairs of conjectures mentioned in the questions, we construct oracles such that one conjecture from the pair is true in the relativized world and the other is false and vice versa). We also show several new connections between the studied conjectures. In particular, we show that the relation between the finite reflection principle and proof systems for existentially quantified Boolean formulas is similar to the one for finite consistency statements and proof systems for non-quantified propositional tautologies. (shrink)

This paper will first introduce first-order mereotopological axioms and axiomatized theories which can be found in some recent literature and it will also give a survey of decidability, undecidability as well as other relevant notions. Then the main result to be given in this paper will be the finite inseparability of any mereotopological theory up to atomic general mereotopology (AGEMT) or strong atomic general mereotopology (SAGEMT). Besides, a more comprehensive summary will also be given via making observations about other (...) properties stronger than undecidability. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

Given a finitely generated group Γ, we study the space Isom(Γ, ℚ������) of all actions of Γ by isometries of the rational Urysohn metric space ℚ������, where Isom(Γ, ℚ������) is equipped with the topology it inherits seen as a closed subset of Isom(ℚ������) Γ . When Γ is the free group ������ n on n generators this space is just Isom(ℚ������) n , but is in general significantly more complicated. We prove that when Γ is finitely generated Abelian there is (...) a generic point in Isom(Γ, ℚ������), i.e., there is a comeagre set of mutually conjugate isometric actions of Γ on ℚ������. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

Let A be a standard transitive admissible set. Σ 1 -separation is the principle that whenever X and Y are disjoint Σ A 1 subsets of A then there is a Δ A 1 subset S of A such that $X \subseteq S$ and $Y \cap S = \varnothing$ . Theorem. If A satisfies Σ 1 -separation, then (1) If $\langle T_n\mid n is a sequence of trees on ω each of which has at most finitely many infinite paths in (...) A then the function $n\mapsto$ (set of infinite paths in A through T n ) is in A. (2) If A is not closed under hyperjump and α = On A then A has in it a nonstandard model of V = L whose ordinal standard part is α. Theorem. Let α be any countable admissible ordinal greater than ω. Then there is a model of Σ 1 -separation whose height is α. (shrink)

Let ≤r and ≤sbe two binary relations on 2ℕ which are meant as reducibilities. Let both relations be closed under finite variation and consider the uniform distribution on 2ℕ, which is obtained by choosing elements of 2ℕ by independent tosses of a fair coin.Then we might ask for the probability that the lower ≤r-cone of a randomly chosen set X, that is, the class of all sets A with A ≤rX, differs from the lower ≤s-cone of X. By c (...) osure under finite variation, the Kolmogorov 0-1 aw yields immediately that this probability is either 0 or 1; in case it is 1, the relations are said to be separable by random oracles.Again by closure under finite variation, for every given set A, the probability that a randomly chosen set X is in the upper ≤r-cone of A is either 0 or 1; let Almostr be the class of sets for which the upper ≤r-cone has measure 1. In the following, results about separations by random oracles and about Almost classes are obtained in the context of generalized reducibilities, that is, for binary relations on 2ℕ which can be defined by a countable set of total continuous functionals on 2ℕ in the same way as the usual resource-bounded reducibilities are defined by an enumeration of appropriate oracle Turing machines. The concept of generalized reducibility comprises a natura resource-bounded reducibilities, but is more general; in particular, it does not involve any kind of specific machine model or even effectivity. The results on generalized reducibilities yield corollaries about specific resource-bounded reducibilities, including several results which have been shown previously in the setting of time or space bounded Turing machine computations. (shrink)

In [6] Messmer and Wood proved quantifier elimination for separably closed fields of finite Ershov invariant e equipped with a (certain) Hasse derivation. We propose a variant of their theory, using a sequence of e commuting Hasse derivations. In contrast to [6] our Hasse derivations are iterative.

Let X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }$$\end{document} be a set of outcomes, and let I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{I }$$\end{document} be an infinite indexing set. This paper shows that any separable, permutation-invariant preference order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} on XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }^\mathcal{I }$$\end{document} admits an additive representation. That is: there exists a linearly ordered abelian group R\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document} and a ‘utility function’ u:X⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u:\mathcal{X }{{\longrightarrow }}\mathcal{R }$$\end{document} such that, for any x,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document} which differ in only finitely many coordinates, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∑i∈Iu-u≥0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{i\in \mathcal{I }} \left[u-u\right]\ge 0$$\end{document}. Importantly, and unlike almost all previous work on additive representations, this result does not require any Archimedean or continuity condition. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} also satisfies a weak continuity condition, then the paper shows that, for anyx,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document}, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∗∑i∈Iu≥∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u\ge {}^*\!\sum _{i\in \mathcal{I }}u$$\end{document}. Here, ∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u$$\end{document} represents a nonstandard sum, taking values in a linearly ordered abelian group ∗R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\mathcal{R }$$\end{document}, which is an ultrapower extension of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document}. The paper also discusses several applications of these results, including infinite-horizon intertemporal choice, choice under uncertainty, variable-population social choice and games with infinite strategy spaces. (shrink)

We define a complete theory SHF e of separably closed fields of finite invariant e (= degree of imperfection) which carry an infinite stack of Hasse-derivations. We show that SHF e has quantifier elimination and eliminates imaginaries.

The ethical philosophy of Emmanuel Levinas is typically associated with a punishing conception of responsibility rather than freedom. In this chapter, our aim is to explore Levinas’s often overlooked theory of freedom. Specifically, we compare Levinas’s account of freedom to the Kantian (and Fichtean) idea of freedom as autonomy and the Hegelian idea of freedom as relational. Based on these comparisons, we suggest that Levinas offers a distinctive conception of freedom—“finite freedom.” In contrast to Kantian autonomy, finite freedom (...) constitutively involves standing in certain social relations with others. And in contrast to Hegelian relational freedom, the social relations involved in finite freedom are not defined by mutual recognition, but by feelings of separation and even antagonism. Along the way, we promote a reading Levinas’s Totality and Infinity as a Hegel-style story of Bildung (development), and show how, on Levinas’s view, freedom can develop or mature in the life of the individual. (shrink)

We give a complete description of minimal groups infinitely definable in separably closed fields of finite degree of imperfection. In particular we answer positively the question of the existence of such a group with infinite transcendence degree (i.e., a minimal group with non thin generic).

We continue the work of [14, 3, 1, 19, 16, 4, 12, 11, 20] investigating the strength of set existence axioms needed for separable Banach space theory. We show that the separation theorem for open convex sets is equivalent to WKL 0 over RCA 0 . We show that the separation theorem for separably closed convex sets is equivalent to ACA 0 over RCA 0 . Our strategy for proving these geometrical Hahn-Banach theorems is to reduce to the finite-dimensional (...) case by means of a compactness argument. (shrink)

We continue the work of [14, 3, 1, 19, 16, 4, 12, 11, 20] investigating the strength of set existence axioms needed for separable Banach space theory. We show that the separation theorem for open convex sets is equivalent to WKL$_0$ over RCA$_0$. We show that the separation theorem for separably closed convex sets is equivalent to ACA$_0$ over RCA$_0$. Our strategy for proving these geometrical Hahn-Banach theorems is to reduce to the finite-dimensional case by means of a compactness (...) argument. (shrink)

What are the assumptions and tasks hidden in contemporary calls to "overcome" the metaphysical tradition? Reflecting upon the internal contradictions of the notions of "tradition" and "finiteness," Dennis J. Schmidt offers novel insights into how philosophy must relate to its traditions if it is to retain a vital sense of the plurality of "edges" that constitute its finiteness. He does this through a close examination of issues found in the work of Hegel and Heidegger, two philosophers who made the ideas (...) of both tradition and finiteness the center of their concern.Schmidt begins by asking how Heidegger can claim to have destroyed metaphysics despite Hegel's claim to have perfected its possibilities. Systematically following the development of Heidegger's critique of Hegel, Schmidt generates a dialogue between them. The topic of that dialogue is the nature of finiteness as it is articulated in time, nothing, the dialectical and hermeneutical circles, and in the notions of experience, work, technology, history, and preSocratic thought.Beginning with Heidegger's critique of Hegel in Being and Time, Schmidt's strategy is to disclose the complexities of philosophical discourse about the finite by drawing out the proximities between Hegel and Heidegger. The dialogue that results presents novel portraits of both philosophers. It also reveals that Heidegger's early, unacknowledged failure to separate himself from the Hegelian dialectic is the motive behind many of the turns and decisions of his later career.In concluding, Schmidt offers an interpretation of the wider significance of the results of that dialogue, and connects his study to other contemporary discussions of postmodernism. He expands upon the idea of the plurality of edges opened by finiteness, arguing that philosophy only understands its own past and future once it recognizes the meaning of its own finiteness.Dennis J. Schmidt is Associate Professor of Philosophy at the State University of New York at Binghamton. The Ubiquity of the Finite is included in the series Studies in Contemporary German Social Thought, edited by Thomas McCarthy. (shrink)

It is well known that for all recursively enumerable sets X 1 , X 2 there are disjoint recursively enumerable sets Y 1 , Y 2 such that $Y_1 \subseteq X_1, Y_2 \subseteq X_2$ and Y 1 ∪ Y 2 = X 1 ∪ X 2 . Alistair Lachlan called distributive lattices satisfying this property separated. He proved that the first-order theory of finite separated distributive lattices is decidable. We prove here that the first-order theory of all separated distributive (...) lattices is undecidable. (shrink)

We show that for an arbitrary logic being locally tabular is a strictly weaker property than being locally finite. We describe our hunt for a logic that allows us to separate the two properties, revealing weaker and weaker conditions under which they must coincide, and showing how they are intertwined. We single out several classes of logics where the two notions coincide, including logics that are determined by a finite set of finite matrices, selfextensional logics, algebraizable and (...) equivalential logics. Furthermore, we identify a closure property on models of a logic that, in the presence of local tabularity, is equivalent to local finiteness. (shrink)

Let F be a finitely generated field and let j : F → N be a weak presentation of F, i.e. an isomorphism from F onto a field whose universe is a subset of N and such that all the field operations are extendible to total recursive functions. Then if R1 and R2 are recursive subrings of F, for all weak presentations j of F, j is Turing reducible to j if and only if there exists a finite collection (...) of non-constant rational functions {Gi} over F such that for every x ε R1 for some i, Gi ε R2. We investigate under what circumstances such a collection of rational functions exists and conclude that in the case when R1 R2 are both holomorphy rings and F is of characteristic 0 or is an algebraic function field over a perfect field of constants, the existence of the above-described collection of rational functions is equivalent to the requirement that the non-archimedean primes which do not appear as poles of elements of R2 do not have factors of relative degree 1 in some simple extension of K. (shrink)

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on substructural logics over the full Lambek Calculus [34], Galatos and Ono [18], Galatos et al. [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated (...) with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics. Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit. (shrink)

The question of whether the bounded arithmetic theories and are equal is closely connected to the complexity question of whether is equal to. In this paper, we examine the still open question of whether the prenex version of,, is equal to. We give new dependent choice‐based axiomatizations of the ‐consequences of and. Our dependent choice axiomatizations give new normal forms for the ‐consequences of and. We use these axiomatizations to give an alternative proof of the finite axiomatizability of and (...) to show new results such as is finitely axiomatized and that there is a finitely axiomatized theory,, containing and contained in. On the other hand, we show that our theory for splits into a natural infinite hierarchy of theories. We give a diagonalization result that stems from our attempts to separate the hierarchy for. (shrink)

Written by a highly respected scholar of Thomas Aquinas's writings, this volume offers a comprehensive presentation of Aquinas's metaphysical thought. It is based on a thorough examination of his texts organized according to the philosophical order as he himself describes it rather than according to the theological order. -/- In the introduction and opening chapter, John F. Wippel examines Aquinas's view on the nature of metaphysics as a philosophical science and the relationship of its subject to divine being. Part One (...) is devoted to his metaphysical analysis of finite being. It considers his views on the problem of the One and the Many in the order of being, and includes his debt to Parmenides in formulating this problem and his application of analogy to finite being. Subsequent chapters are devoted to participation in being, the composition of essence and esse in finite beings, and his appeal to a kind of relative nonbeing in resolving the problem of the One and the Many. Part Two concentrates on Aquinas's views on the essential structure of finite being, and treats substance-accident composition and related issues, including, among others, the relationship between the soul and its powers and unicity of substantial form. It then considers his understanding of matter-form composition of corporeal beings and their individuation. Part Three explores Aquinas's philosophical discussion of divine being, his denial that God's existence is self-evident, and his presentation of arguments for the existence of God, first in earlier writings and then in the "Five Ways" of his Summa theologiae. A separate chapter is devoted to his views on quidditative and analogical knowledge of God. The concluding chapter revisits certain issues concerning finite being under the assumption that God's existence has now been established. -/- John F. Wippel, professor of philosophy at The Catholic University of America, was recently awarded the prestigious Aquinas Medal by the American Catholic Philosophical Association. In addition to numerous articles and papers, Wippel has coauthored or edited several other works, including Metaphysical Themes in Thomas Aquinas and The Metaphysical Thought of Godfrey of Fontaines, both published by CUA Press. (shrink)

Let K be a countable field. Then a weak presentation of K is an isomorphism of K onto a field whose elements are natural numbers, such that all the field operations are extendible to total recursive functions. Given a pair of two non-finitely generated countable fields contained in some overfield, we investigate under what circumstances the overfield has a weak presentation under which the given fields have images of arbitrary Turing degrees or, in other words, we investigate Turing separability (...) of various pairs of non-finitely generated fields. (shrink)

The main scope of this short article is to provide a modification of the axioms given by Messmer and Wood for the theory of separably closed fields of positive characteristic and finite imperfectness degree. As their original axioms failed to meet natural expectations, a new axiomatization was given (i.e., Ziegler’s one), but the new axioms do not follow Messmer and Wood’s initial idea. Therefore, we aim to give a correct axiomatization that is more similar to the original one and (...) that, as with the original axioms, involves only one Hasse–Schmidt derivation, this time based on the iterativity conditions corresponding to the Witt group. (shrink)

CH implies that selective separability is not preserved by finite powers . In ZFC, selective separability does not imply H-separability.

The Cartesian concept of nature, which has determined modern thinking until the present time, has become obsolete. It shall be shown that Hegel's objective-idealistic conception of nature discloses, in comparison to that of Descartes, new perspectives for the comprehension of nature and that this, in turn, results in possibilities of actualizing Hegel's philosophy of nature. If the argumentation concerning philosophy of nature is intended to catch up with the concrete Being-of-nature and to meet it in its concretion, then this is (...) impossible for the finite spirit in a strictly a priori sense – this is the thesis supported here which is not at all close to Hegel. As the argumentation rather has to consider the conditions of realization concerning the Being-of-nature, too, it is compelled to take up empirical elements – concerning the organism, for instance, system-theoretical aspects, physical and chemical features of the nervous system, etc. With that, on the one hand, empirical-scientific premises are assumed (e.g. the lawlikeness of nature), which on the other hand become (now close to Hegel) possibly able to be founded in the frame of a Hegelian-idealistic conception. In this sense, a double strategy of empirical-scientific concretization and objective-idealistic foundation is followed up, which represents the methodical basic principle of the developed considerations. In the course of the undertaking, the main aspects of the whole Hegelian design concerning the philosophy of nature are considered – space and time, mass and motion, force and law of nature, the organism, the pro-blem of evolution, psychic being – as well as Hegel's basic thesis concerning the philosophy of nature, that therein a tendency toward coherence and idealization manifests itself in the sense of a (categorically) gradually rising succession of nature: from the separateness of space to the ideality of sensation. In the sense of the double strategy of concretization and foundation it is shown that on the one hand possibilities of philosophical penetration concerning actual empirical-scientific results are opened, and on the other hand – in turn – a re-interpretation of Hegel's theorem on the basis of physical, evolution-theoretical and system-theoretical argumentation also becomes possible. In this mutual crossing-over and elucidation of empirical and Hegelian argumentation not only do perspectives of a new comprehension of nature become visible, but also, at the same time – as an essential consequence of this methodical principle – thoughts on the possibilities of actualizing Hegel's philosophy of nature. (shrink)

We give an alternative proof of the stability of separably closed fields of fixed Éršov invariant to the one given in [W]. We show that in case the Éršov invariant is finite, the theory is in fact equational. We also characterize the independence relation in those theories.

This book presents a new theory of the nature of the space in which substantial, enduring objects (objects that are identifiable for more than a fleeting instant) connect with each other and cohere within themselves. This posited fundamental space underlies the common perception of space as necessarily having to identify its contents by separating them within finite beginning and ending boundaries. In the real space each entity is positive and is directly connected to every entity. These connections differ depending (...) on the spatial and temporal dimensions in which they are defined and viewed. This offers a radically new solution to the mind-body problem, which rechearchers in mind-brain theory have not yet satisfactorily solved. And it resolves the conflicting interpretations of quantum physics vs. classical relativistic physics. Even more encouraging to readers who are not specialists in the sciences are the implications for realizing enduring values and a greater appreciation of excellence in our work, education, avocations, and the kindof entertainment we seek. (shrink)

We study hybrid logics in topological semantics. We prove that hybrid logics of separation axioms are complete with respect to certain classes of finite topological models. This characterisation allows us to obtain several further results. We prove that aforementioned logics are decidable and PSPACE-complete, the logics of T 1 and T 2 coincide, the logic of T 1 is complete with respect to two concrete structures: the Cantor space and the rational numbers.

Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We (...) review the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

In the paper it will be shown that Reichenbach’s Weak Common Cause Principle is not valid in algebraic quantum field theory with locally finite degrees of freedom in general. Namely, for any pair of projections A, B supported in spacelike separated double cones ${\mathcal{O}}_{a}$ and ${\mathcal{O}}_{b}$ , respectively, a correlating state can be given for which there is no nontrivial common cause (system) located in the union of the backward light cones of ${\mathcal{O}}_{a}$ and ${\mathcal{O}}_{b}$ and commuting with the (...) both A and B. Since noncommuting common cause solutions are presented in these states the abandonment of commutativity can modulate this result: noncommutative Common Cause Principles might survive in these models. (shrink)

In this note we show that groups with definable generics in a separably closed valued field K of finite imperfection degree can be embedded into groups definable in the algebraic closure of K.

A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is arbitrarily more complicated than (...) an algorithm which simply solves the word problem. In a given group the lowest degree of complexity that can be realised by a pseudo-natural algorithm is essentially the derivational complexity of that group. Thus the result separates the derivational complexity of the word problem of a finitely presented group from its intrinsic complexity. The proof given in [13] involves the construction of a finitely presented group G from a Turing machine T such that the intrinsic complexity of the word problem for G reflects the complexity of the halting problem of T, while the derivational complexity of the word problem for G reflects the runtime complexity of T. The proof of one of the crucial lemmas in [13] is only sketched, and part of the purpose of this paper is to give the full details of this proof. We will also obtain a variant of their proof, using modular machines rather than Turing machines. As for several other results, this simplifies the proofs considerably. MSC: 03D40, 20F10. (shrink)

We study the infinitely definable subgroups of the additive group in a separably closed field of finite positive imperfection degree. We give some constructions of families of such subgroups which confirm the diversity and the richness of this class of groups. We show in particular that there exists a locally modular minimal subgroup such that the division ring of its quasi-endomorphisms is not a fraction field of the ring of its definable endomorphisms, and that in contrast there exist 20 (...) pairwise orthogonal locally modular minimal subgroups whose induced structure is exactly that of an-vector space. We also show that there exist infinitely many pairwise orthogonal subgroups of infinite U-rank. Furthermore, these constructions are carried out in the additive group considered as a module over its ring of definable endomorphisms. (shrink)

Discussions of supererogation usually focus on cases in which the agent can choose among a finite number of options. However, Daniel Muñoz has recently shown that cases in which the agent faces an infinite chain of increasingly less good options make trouble for existing definitions of supererogation. Muñoz proposes a promising new definition as a solution to the problem of infinite cases. I argue that any acceptable account of supererogation must (1) enable us to accurately identify supererogatory acts in (...) both finite and infinite option cases. It must also (2) include a suitably related account of what makes one act more supererogatory than another for finite, infinite, single-choice (one agent choosing among several supererogatory options) and inter-choice (two different agents, each choosing a supererogatory option) cases. I further argue that the best current account of supererogation for finite cases works well for finite cases, but cannot handle infinite cases. However, Muñoz’s proposal cannot handle inter-choice cases in either finite or infinite cases. I conclude we still need an account for infinite cases, and may have to settle for separate definitions of supererogation for finite and infinite cases. (shrink)

In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent of ZFin0.<br><br>An (...) equivalent theory of sets and an equivalent foundation for arithmetic was introduced by John Mayberry and developed by the current author in his doctoral thesis. In that thesis, the independence results mentioned above are proved using proof-theoretic methods. In this paper, I offer model-theoretic proofs of the central independence results using the technique of cumulation models, which was introduced by Steve Popham, a doctoral student of Mayberry<br>from the early 1980s. (shrink)

Work of Eagle, Farah, Goldbring, Kirchberg, and Vignati shows that the only separable C*‐algebras that admit quantifier elimination in continuous logic are,,, and the continuous functions on the Cantor set. We show that, among finite dimensional C*‐algebras, quantifier elimination does hold if the language is expanded to include two new predicate symbols: One for minimal projections, and one for pairs of unitarily conjugate elements. Both of these predicates are definable, but not quantifier‐free definable, in the usual language of C*‐algebras. (...) We also show that adding just the predicate for minimal projections is sufficient in the case of full matrix algebras, but that in general both new predicate symbols are required. (shrink)

We show that the Axiom of Countable Choice is necessary and sufficient to prove that the existence of a Borel measure on a pseudometric space such that the measure of open balls is positive and finite implies separability of the space. In this way a negative answer to an open problem formulated in Górka (Am Math Mon 128:84–86, 2020) is given. Moreover, we study existence of maximal $$\delta $$ δ -separated sets in metric and pseudometric spaces from the (...) point of view the Axiom of Choice and its weaker forms. (shrink)

These two powers or capacities cannot exchange their functions. The understanding can intuit nothing, the senses can think nothing. Only through their union can knowledge arise. But that is no reason for confounding the contribution of either with that of the other; rather is it a strong reason for carefully separating and distinguishing the one from the other. The passages are so well known because Kant laid such massive importance on them. His claims about the strict distinction between these two (...) “sources,” even as he emphasized their necessarily intertwined, even inseparable role in knowledge, was the basis of his critique of the entire prior philosophical tradition, elements of which, he famously claimed, either “sensualized all concepts of the understanding” or “intellectualized” appearances.[i]. (shrink)

The signature of the formal language of mereotopology contains two predicates $P$ and $C$, which stand for “being a part of” and “contact,” respectively. This paper will deal with the decidability issue of the mereotopological theories which can be formed by the axioms found in the literature. Three main results to be given are as follows: all axiomatized mereotopological theories are separable; all mereotopological theories up to $\mathbf{ACEMT}$, $\mathbf{SACEMT}$, or $\mathbf{SACEMT}^{\prime}$ are finitely inseparable; all axiomatized mereotopological theories except $\mathbf{SAX}$, $\mathbf{SAX}^{\prime}$, (...) or $\mathbf{S\overline{B}X}^{\prime}$, where $\mathbf{X}$ is strictly stronger than $\mathbf{CEMT}$, are undecidable. Then it can also be easily seen that all axiomatized mereotopological theories proved to be undecidable here are neither essentially undecidable nor strongly undecidable but are hereditarily undecidable. Result will be shown by constructing strongly undecidable mereotopological structures based on two-dimensional Euclidean space, and it will be pointed out that the same construction cannot be carried through if the language is not rich enough. (shrink)

It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of regularity, and (...) that the countable axiom of choice for families of finite sets CACfin does not imply the statement “Compact metric spaces are separable”. (shrink)