It is proved, within Bishop's constructive mathematics , that, in the context of a Hilbert space, the Open Mapping Theorem is equivalent to a principle that holds in intuitionistic mathematics and recursive constructive mathematics but is unlikely to be provable within BISH.

This paper provides a partial solution to the completeness problem for Joyal's axiomatization of open and etale maps, under the additional assumption that a collection axiom holds.

We show that a morphism of locales is open if and only if all its pullbacks are skeletal in the sense of [P.T. Johnstone, Factorization theorems for geometric morphisms, II, in: Categorical Aspects of Topology and Analysis, in: Lecture Notes in Math., vol. 915, Springer-Verlag, 1982, pp. 216–233], i.e. pulling back along them preserves denseness of sublocales . This result may be viewed as the ‘dual’ of the well-known characterization of proper maps as those which are stably closed. We (...) also investigate the circumstances in which a particular sublocale, or set of sublocales, of a given locale, may be ‘declared closed’. (shrink)

Given a program of a linear bounded and bijective operator T, does there exist a program for the inverse operator T−1? And if this is the case, does there exist a general algorithm to transfer a program of T into a program of T−1? This is the inversion problem for computable linear operators on Banach spaces in its non-uniform and uniform formulation, respectively. We study this problem from the point of view of computable analysis which is the Turing machine based (...) theory of computability on Euclidean space and other topological spaces. Using a computable version of Banach’s Inverse Mapping Theorem we can answer the first question positively. Hence, the non-uniform version of the inversion problem is solvable, while a topological argument shows that the uniform version is not. Thus, we are in the striking situation that any computable linear operator has a computable inverse while there exists no general algorithmic procedure to transfer a program of the operator into a program of its inverse. As a consequence, the computable version of Banach’s Inverse Mapping Theorem is a powerful tool which can be used to produce highly non-constructive existence proofs of algorithms. We apply this method to prove that a certain initial value problem admits a computable solution. As a preparation of Banach’s Inverse Mapping Theorem we also study the Open Mapping Theorem and we show that the uniform versions of both theorems are limit computable, which means that they are effectively -measurable with respect to the effective Borel hierarchy. (shrink)

In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The (...) purpose of the present paper is to study the relationship more finely, by seeking an explicit map between the component orderings involved in each of the two kinds of contraction. It is shown that at least in the finite case a suitable map exists, with the consequence that the relational, transitively relational, and antisymmetrically relational partial meet contraction functions form identifiable subclasses of the safe contraction functions, over any theory finite modulo logical equivalence. In the process of constructing the map, as the composition of four simple transformations, mediating notions of bottom and top contraction are introduced. The study of the infinite case remains open. (shrink)

In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.

We give positive answers to two open questions from [15]. (1) For every set C countably determined over A, if C is Π 0 α (Σ 0 α ) then it must be Π 0 α (Σ 0 α ) over A, and (2) every Borel subset of the product of two internal sets X and Y all of whose vertical sections are Π 0 α (Σ 0 α ) can be represented as an intersection (union) of Borel sets (...) with vertical sections of lower Borel rank. We in fact show that (2) is a consequence of the analogous result in the case when X is a measurable space and Y a complete separable metric space (Polish space) which was proved by A. Louveau and that (1) is equivalent to the property shared by the inverse standard part map in Polish spaces of preserving almost all levels of the Borel hierarchy. (shrink)

The spectral mapping theorem in a unital Banach algebra is examined for its constructive content.

This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second preframe constructions. The symmetries between these two approaches to locale theory are explored. Given an informal assumption that open locale maps are parallel to proper maps we argue that various pairs of locale theory results are ‘parallel’, that is, identical in structure but prove facts about proper maps on one side of the pair (...) and about open maps on the other. The pairs of results are: pullback stability of proper/open maps, regularity of the category of compact Hausdorff/discrete locales, and theorems on information systems. Some remarks are included on a possible formalization of this parallel as a duality. (shrink)

This research is motivated by the program of reverse mathematics and non-standard arguments in second-order arithmetic. Within a weak subsystem of second-order arithmetic ACA0, we investigate some aspects of non-standard analysis related to sequential compactness. Then, using arguments of non-standard analysis, we show the equivalence of the Riemann mapping theorem and ACA0 over WKL0. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim).

In this paper, we introduce systems of nonstandard second-order arithmetic which are conservative extensions of systems of second-order arithmetic. Within these systems, we do reverse mathematics for nonstandard analysis, and we can import techniques of nonstandard analysis into analysis in weak systems of second-order arithmetic. Then, we apply nonstandard techniques to a version of Riemannʼs mapping theorem, and show several different versions of Riemannʼs mapping theorem.

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space (...) form a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

The brain displays both the anatomical features of a vast amount of interconnected topological mappings as well as the functional features of a nonlinear, metastable system at the edge of chaos, equipped with a phase space where mental random walks tend towards lower energetic basins. Nevertheless, with the exception of some advanced neuro-anatomic descriptions and present-day connectomic research, very few studies have been addressing the topological path of a brain embedded or embodied in its external and internal environment. Herein, by (...) using new formal tools derived from algebraic topology, we provide an account of the metastable brain, based on the neuro-scientific model of Operational Architectonics of brain-mind functioning. We introduce a “topodynamic” description that shows how the relationships among the countless intertwined spatio-temporal levels of brain functioning can be assessed in terms of projections and mappings that take place on abstract structures, equipped with different dimensions, curvatures and energetic constraints. Such a topodynamical approach, apart from providing a biologically plausible model of brain function that can be operationalized, is also able to tackle the issue of a long-standing dichotomy: it throws indeed a bridge between the subjective, immediate datum of the naïve complex of sensations and mentations and the objective, quantitative, data extracted from experimental neuro-scientific procedures. Importantly, it opens the door to a series of new predictions and future directions of advancement for neuroscientific research. (shrink)

We say that a Hausdorff locale is compactly generated if it is the colimit of the diagram of its compact sublocales connected by inclusions. We show that this is the case if and only if the natural map of its frame of opens into the second Lawson dual is an isomorphism. More generally, for any Hausdorff locale, the second dual of the frame of opens gives the frame of opens of the colimit. In order to arrive at this conclusion, we (...) generalize the Hofmann–Mislove–Johnstone theorem and some results regarding the patch construction for stably locally compact locales. (shrink)

A systematic approach to the algebraic and Kripke semantics for logics with restricted structural rules, notably for logics on an underlying non-distributive lattice, is developed. We provide a new topological representation theorem for general lattices, using the filter space X. Our representation involves a galois connection on subsets of X, hence a closure operator $\Gamma$, and the image of the representation map is characterized as the collection of $\Gamma$-stable, compact-open subsets of the filter space . The original lattice (...) ${\cal L}$ is thus imbedded in the complete lattice of stable sets. The representation is shown to be functorial and is extended to a Stone-type duality. ;In the presence of additional operators, the extension problem is addressed in terms of what we call adjoint completions of normal operators. An operator f on a lattice L is normal if f: $L\sp{} \times \cdots \times L\sp{} \to L\sp{}$ is a monotone map, where each $L\sp{}$, $i \in n$ + 1, is either L or $L\sp{op}$ and f sends finite joins of $L\sp{}$ to joins in $L\sp{}$. Every familiar operator, such as $\circ$ , + , $\gets, \to, \neg, \square$ O is normal. By a uniform argument we show that normal operators $f\sb{i}$ on L extend to operators $F\sb{i}$ on $\Gamma X$ that distribute over arbitrary joins or meets and that \sb{i\in I})$ is a universal such extension. ;We also raise and resolve the question of representability of operators on stable sets by relations. We give an extensive number of examples of representation of specific operators and provide explicit constructions of canonical Kripke frames, based on our extension arguments, for a number of logical systems, notably for Intuitionistic and Classical Linear Logics, or Non-commutative Linear Logic and of fragments thereof. (shrink)

In this paper we work in an arbitrary o-minimal structure with definable Skolem functions and prove that definably connected, locally definable manifolds are uniformly definably path connected, have an admissible cover by definably simply connected, open definable subsets and, definable paths and definable homotopies on such locally definable manifolds can be lifted to locally definable covering maps. These properties allow us to obtain the main properties of the general o-minimal fundamental group, including: invariance and comparison results; existence of universal (...) locally definable covering maps; monodromy equivalence for locally constant o-minimal sheaves – from which one obtains, as in algebraic topology, classification results for locally definable covering maps, o-minimal Hurewicz and Seifert–van Kampen theorems. (shrink)

Logic in Action/Doron Avital Nothing is more difficult, and therefore more precious, than to be able to decide (Napoleon Bonaparte) Introduction -/- This book was born on the battlefield and in nights of secretive special operations all around the Middle East, as well as in the corridors and lecture halls of Western Academia best schools. As a young boy, I was always mesmerized by stories of great men and women of action at fateful cross-roads of decision-making. Then, like as today, (...) I felt the full weight of the moment of truth as it confronts the individual, the man or woman of action, with the imminent necessity to decide. Alongside, as I was climbing up the ladder of education, I found myself just as well captivated by the great intellectual stories of our times, in particular 20th century analytic philosophy and, at its core, the machinery of modern logic. How do then the cool contemplative modes of the philosophical and analytic outlooks, that are better fitting of the philosopher's armchair at the fireplace, hang together with the heat of the battlefield or the angst of the ticking clock of time left to the completion of a daring special operation? Growing up I was pondering exactly that. Not accidently, and in fact as consequence, I have chosen a course in life that challenged me to visit the poles of both theory and practice. I set myself on a mission to unravel the tension between the contemplative inquiry, supposedly theoretical, aiming at the logical structure of things, and the uncompromising test of life and action. The puzzle of the gap between theory and practice has become ever since the guiding question of my life. -/- Not long ago, I met two friends, Avner Shor, a veteran combat soldier of the special forces unit I eventually commanded, and Aviram Halevi, a fellow officer with whom I served. Why will we not put into writing the ideas that guided us during our years of military action, we wondered. At that time, I used to deliver the keynote lectures to the senior officers' course of Israel central intelligence organization, the Mossad. For this I already had to put some of these ideas in writing. Avner was quick to introduce me with a notable publisher and even helped me write the first chapter. With Aviram I sat to many meetings, where he would challenge me with key questions, and we followed them with memories of operations and battles, aiming to draw the required lessons. This served me well when I finally sat down to write the first draft of the book. The result was more extensive than me and my friends had expected. I had to add a particularly long chapter dealing with the story of modern philosophy and logic. This was required, I felt, as no decision-making process lives in an intellectual vacuum. Knowingly or subconsciously, the intellectual climate of the time guides us for better or worse with the decisions we finally take. The initial draft was naturally cumbersome and inaccessible. But here I had the privilege of meeting a particularly talented editor, Rami Rothholtz. I found in Rami both an editor and a critical reader. As an infantry combat soldier at youth and now a senior journalist and editor, Rami insisted on simplifying and refining my ideas. Had it not been for his work, this book would have been literally unreadable. *** I opened my book with a brief description of a single night of a special operation deep at the Lebanon Bekaa valley, far away from Israel northern border. The mission was to kidnap a senior terror leader known to be holding in captivity an Israeli pilot. This was also the last special operation I commanded in my military career. A single special operation night, but what had to precede it? For sure, many months of intense and skillful preparations. What is Planning? This is the question with which I open up chapter (2) of the book. I confront in this chapter two approaches to planning. The first is the one I saw as a mission to myself to cultivate in my many years of military service. The second is the one I saw as representing a deep-rooted fallacy that holds a firm grip on today's conventional wisdom about planning. To further examine the logic of the competing models, I was required in chapter (3) to analyze the concept of "The Standard". I argue that the false model of planning has its roots in an attitude of an uncompromising adherence to the power of literal obedience to standards and rules. The standard, or what is outlined by a rule as prescribing a future course of action, is seen as an answer to the fundamental tension between theory (planning) and practice (execution). I argue in contrast that the standard does not produce an answer but rather what I call: "A Well-Defined Question". In essence, it is a meticulously-well-planned invitation to exercise a fresh judgment. A judgement that has as an anchor the default answer that the standard produces but is open to extension as it confronts the new frame of reference of the test of reality. In chapter (4), I present a new tool for planning and execution: "The Polygon of Risks" or "The Polygon of Execution". The Polygon is a geometric illustration of the underlying tension that exists between all dimensions of the operational project. The construction and conceptualization of the trade-offs that exist between the various dimensions - segments of the polygon - is the first topic on the planner's agenda. I position the concepts of "Daring" and "Taking Proactive and Well-Informed Risks" as necessary logical constituents of the polygon and show how in contrast the false model of planning is responsible for an operational culture that is risk-averse. It encourages, in fact, the piling up of false securities at the segments' level that eventually lead to the collapse of the polygon. The necessary trade-offs relationships that exist between the segments of the polygon express the fundamental tension between partnership and competition: partnership in a joint goal and competition over resources, both material and abstract. When this tension is not managed well, that is, when the players' local optimizations overshadow the global optimization required for the success of the project, the execution polygon collapses. In this scenario, we may find the setting of the bar of "High Standards" in a players' spheres of responsibility to conceal a hidden agenda of personal insurances taken against a possible failure. Once the overall risk is not mitigated by way of collaborative joint executional dialogue, the process that leads to a collapse of the polygon is literally unstoppable. *** In chapter (5), I discuss "(Fateful) Decisions". I examine the way in which we should translate the polygon into sequential critical decisions on the timeline. The execution polygon is not a rigid scaffolding but a dynamic conceptual illustration of the -/- project. It will need now to be converted into successive decision junctions. We will find the content of a decision and its timing on the timeline to be inseparable. The right decision is the one that is taken at the right time. The moment of decision is in fact the last moment of deliberation, the first moment available for action, i.e. the first possible "Can" is also the latest possible "Must". Deciding too soon is analog to the "Jumping of the Gun". The decision maker is forcing a pre-conceived answer to a state of affairs not ripe for an answer, e.g. the target in the shooting range is not yet erected. Late to decide and the decision maker may envision what he or she should have done but reality is no longer available for them to harness it right, e.g. consider a tennis player's frustration when reviewing a too-late-to-react move in the video replay. I review in this chapter many fateful decisions, both historical, from Napoleon's Waterloo, to a Bridge Too Far of WWII, to the failed rescue attempt of American hostages at the time of the Iranian Revolution, as well as fateful decisions I had to take in the course of my military life, both in combat and in special operations, and show the sense in which they all answer to our analysis. The theme of chapter (6) is "The Moment of Truth". This is the moment when everything is on the line and from which there is no turning back. I discuss the formative repetitive structure of the schooling and simulation phase and contrast it with the "One Shot, One Opportunity" nature of the moment of truth. This is extremely helpful when we analyze the logical structure of failures as unwarranted repetitions of past lessons. The schooling curriculum indeed consists of important abstractions drawn from lessons of the past. However, it is when we project them in a fashion that is literal or mechanical that we cross path with the possibility of a failure. The paradox of education is that what we must repeat in school and simulation must be extended and not repeated in real life. What is required of us so we do not fall into the fallacy of repetition in face of the moment of truth is the core subject of the discussion of this chapter. In chapter (7), I took a lengthy philosophical detour surveying the intellectual drama of modern logic, and in general, the story of 20th century analytic philosophy. Readers who choose to bypass the somehow demanding narrative of this drama can do so and still keep the argumentative thread of the book. However, even by way of skipping the more technical parts, I would still urge the readers to delve into the discussion in this chapter as I believe this would grant them a deeper understanding of the overall conceptual framework. I explore here the work of two key figures: the logician Kurt Gödel and the philosopher Ludwig Wittgenstein, both were crowned in 2000 by TIME Magazine, as the leading Logician and Philosopher, respectively, of the 20th Century. I review the fascinating logical result of Gödel's Incompleteness Theorem and examine its relevance as setting a theoretical limit to the power of formalization. This amazing logical result - a result that shakes the logical foundations of 20th century thought in as much as the discovery of irrational numbers shook the foundations of the Pythagorean program of the ancient Greeks - bears significantly on the question of action and the blind trust we place in the power of formalization in the form of protocols and rules. It is here that Wittgenstein's philosophy enters in full force. We follow Wittgenstein as he dismantles our conception of rules as if there were "Railroads to Infinite", i.e. as prescribing for us in-advance their proper employments in all possible -/- future eventualities. Instead we propose that the dilemma of action demands of us an extension of rules rather than a mechanical or blind repetition of their literal imperative. In turn, this extension can serve as a new lesson added to the curriculum of school and simulation. The theme of chapter (8), the concluding chapter, is Strategy, Logic, and Ethics. The chapter comes to place the ethical dilemma in the conceptual map we presented in the book. I discuss here the tension between strategy as a process of setting goals and deriving backward as it were the steps that are necessary for achieving these goals, to the inescapable dictation of the ethical imperative. This unavoidable tension is particularly important against the backdrop of contemporary culture that is guided by a vision of personal success and achievement that may threaten our ability to do what is right. Most of all, I am troubled in this chapter, with the role logic may play, first as a liberating force enabling a change that is tuned to the ethical imperative, and second, as a force designed to justify on logical grounds, as it were, the existing power structure. It is in this junction that brave individuals will be called to challenge the governing logic of the zeitgeist - logic that operates now as an oppressive force that serves the vested interest of beneficials of the existing order. When success is favored over doing what is right, as we must admit is the prevailing cultural mood of our times, that the words of Emanuel Kant carry their full weight: "Do the Right thing and leave the Consequences to God". For this we need heroes and heroines that challenge the time by bearing the full weight of responsibility that comes with the doing of what is Right. *** This book was written more than anything from the perspective of the heroes and heroines of action. Sometimes they may be missing the exact words or the full insight into the solid logical complexity that stands between them and the doing of what is right. They feel what is right to do on the battlefield of life, whether in real battle, in political or economic life or whether in the life of creativity and the quest of the intellect. They do need, in analogy, proper logical and intellectual artillery. I hope they will find the logical cannons they require as they travel through the pages of this book. The rest is in their hands at the Moment of Truth. -/- Doron Avital, Tel Aviv 2011 -/- . (shrink)

In this work we study dimensional theoretical properties of some a±ne dynamical systems. By dimensional theoretical properties we mean Hausdor® dimension and box- counting dimension of invariant sets and ergodic measures on theses sets. Especially we are interested in two problems. First we ask whether the Hausdor® and box- counting dimension of invariant sets coincide. Second we ask whether there exists an ergodic measure of full Hausdor® dimension on these invariant sets. If this is not the case we ask the (...) question, whether at least the variational principle for Haus- dor® dimension holds, which means that there is a sequence of ergodic measures such that their Hausdor® dimension approximates the Hausdor® dimension of the invariant set. It seems to be well accepted by experts that these questions are of great importance in developing a dimension theory of dynamical systems (see the book of Pesin about dimension theory of dynamical systems [PE2]). Dimensional theoretical properties of conformal dynamical systems are fairly well understood today. For example there are general theorems about conformal repellers and hyperbolic sets for conformal di®eomorphisms (see chapter 7 of [PE2]). On the other hand the existence of two di®erent rates of expansion or contraction forces problems that are not captured by a general theory this days. At this stage of de- velopment of the dimension theory of dynamical systems it seems natural to study non conformal examples. This is the ¯rst step to understand the mechanisms that determine dimensional theoretical properties of non conformal dynamical systems. A±ne dynamical systems represent simple examples of non conformal systems. They are easy to de¯ne, but studying their dimensional theoretical properties does never- theless provide challenging mathematical problems and exemplify interesting phe- nomena. We consider here a special class of self-a±ne repellers in dimension two, depending on four parameters (see 2.1.). Furthermore we study a class of attractors of piecewise a±ne maps in dimension three depending on four parameters as well. The last object of our work are projections of these maps that are known as gener- alized Baker's transformations (see 2.2.). The contents of our work is the following: In chapter two we give an overview about some main results in the area of di- mension theory of a±ne dynamical systems and de¯ne the systems we study in this work. We will explain, what is known about the dimensional theoretical properties of these systems and describe what our new results are. In chapter three we then apply symbolic dynamics to our systems. We will introduce explicit shift codings 4 and ¯nd representations of all ergodic measures for our systems using these codings. From chapter four to chapter eight we study dimensional theoretical properties, which our systems generally or generically have. In chapter four we will prove a formula for the box-counting dimension of the repellers and the attractors (see the- orem 4.1.). Then in chapter ¯ve we apply general dimensional theoretical results for ergodic measures found by Ledrappier and Young [LY] and Barreira, Schmeling and Pesin [BPS] to our systems. These results relate the dimension of ergodic measures to metric entropy and Lyapunov exponents. Using this approach we will be able to reduce questions about the dimension of ergodic measures in our context to ques- tions about certain overlapping and especially overlapping self-similar measures on the line. These overlapping self-similar measures are studied in chapter six. Our main theorem extends a result of Peres and Solomyak [PS2] concerning the absolute continuity resp. singularity of symmetric self-similar measures to asymmetric ones (see theorem 6.1.3.). In chapter seven we bring our results together. We prove that we generically (in the sense of Lebesgue measure on a part of the parameter space) have the iden- tity of box-counting and Hausdor® dimension for the repellers and the attractors. (see theorem 7.1.1. and corollary 7.1.2.). This result suggest that one can expect that the identity of box-counting dimension and Hausdor® dimension holds at least generically in some natural classes of non conformal dynamical systems. Furthermore we will see in chapter seven that there generically exists an ergodic measure of full Hausdor® dimension for the repellers. On the other hand the vari- ational principle for Hausdor® dimension is not generic for the attractors. It holds only if we assume a certain symmetry (see theorem 7.1.1.). For generalized Baker's transformations we will ¯nd a part of the parameter space where there generically is an ergodic measure of full dimension and a part where the variational principle for Hausdor® dimension does not hold (see theorem 7.1.3.). Roughly speaking the reason why the variational principle does not hold here is, that if there exists both a stable and an unstable direction one can not generically maximize the dimension in the stable and in the unstable direction at the same time. In an other setting this phenomenon was observed before by Manning and McCluskey [MM]. In chapter eight we extend some results of the last section to invariant sets that correspond to special Markov chains instead of full shifts (see theorem 8.1.1.). In the last two chapters of our work we are interested in number theoretical excep- tions to our generic results. The starting point of our considerations in section nine are results of ErdÄos [ER1] and Alexander and Yorke [AY] that establish singularity and a decrease of dimension for in¯nite convolved Bernoulli measures under special conditions. Using a generalized notion of the Garsia entropy ([GA1/2]) we are able 5 to understand the consequences of number theoretical peculiarities in broader class of overlapping measures (see theorem 9.1.1.). In chapter ten we then analyze number theoretical peculiarities in the context of our dynamical systems. We restrict our attention to a symmetric situation where we generically have the existence of a Bernoulli measure of full dimension and the identity of Hausdor® and box-counting dimension for all of our systems. In the ¯rst section of chapter ten we ¯nd parameter values such that the variational principle for Hausdor® dimension does not hold for the attractors and for the Fat Baker's transformations (see theorem 10.1.1.). These are the ¯rst known examples of dynamical systems for which the variational principle for Hausdor® dimension does not hold because of number theoretical peculiarities of parameter values. For the repellers we have been able to show that under certain number theoretical conditions there is at least no Bernoulli measure of full Hausdor® dimension; the question if the variational principle for Hausdor® dimension holds remains open in this situation. In the second section of chapter ten we will show that the identity for Hausdor® and box-counting dimension can drops because there are number theoretical pecu- liarities. In the context of Weierstrass-like functions this phenomenon was observed by Przytycki and Urbanski [PU]. Our theorem extends this result to a larger class of sets, invariant under dynamical systems (see theorem 10.2.1). At the end of this work the reader will ¯nd two appendices, a list of notations and the list of references. In appendix A we introduce the notions of dimension we use in this work and collect some general facts in dimension theory. In appendix B we state the facts about Pisot-Vijayarghavan number, we need in our analysis of number theoretical peculiarities. The list of notations contains general notations and a table with a summary of notations we use to describe the dynamical systems that we study. Acknowledgments I wish to thank my supervisor JÄorg Schmeling for a lot of valuable discussion and all his help. Also thanks to Luis Barreira for his great hospitality in Lisboa and many interesting comments. This work was done while I was supported by "Promotionstipendium gem. NaFÄoG der Freien UniversitÄat Berlin". (shrink)

Theories in the usual sense, as characterized by a language and a set of theorems in that language ("statement view"), are related to theories in the structuralist sense, in turn characterized by a set of potential models and a subset thereof as models ("non-statement view", J. Sneed, W. Stegmüller). It is shown that reductions of theories in the structuralist sense (that is, functions on structures) give rise to so-called "representations" of theories in the statement sense and vice versa, where representations (...) are understood as functions that map sentences of one theory into another theory. It is argued that commensurability between theories should be based on functions on open formulas and open terms so that reducibility does not necessarily imply commensurability. This is in accordance with a central claim by Stegmüller on the compatibility of reducibility and incommensurability that has recently been challenged by D. Pearce. (shrink)

Formal systems are standardly envisaged in terms of a grammar specifying well-formed formulae together with a set of axioms and rules. Derivations are ordered lists of formulae each of which is either an axiom or is generated from earlier items on the list by means of the rules of the system; the theorems of a formal system are simply those formulae for which there are derivations. Here we outline a set of alternative and explicitly visual ways of envisaging and analyzing (...) at least simple formal systems using fractal patterns of infinite depth. Progressively deeper dimensions of such a fractal can be used to map increasingly complex wffs or increasingly complex 'value spaces', with tautologies, contradictions, and various forms of contingency coded in terms of color. This and related approaches, it turns out, offer not only visually immediate and geometrically intriguing representations of formal systems as a whole but also promising formal links (1) between standard systems and classical patterns in fractal geometry, (2) between quite different kinds of value spaces in classical and infinite-valued logics, and (3) between cellular automata and logic. It is hoped that pattern analysis of this kind may open possibilities for a geometrical approach to further questions within logic and metalogic. (shrink)

Abstract:In the pedagogy of Western classical string music, creativity is often viewed according to the works of luminary composers, suggesting the question: how might string teachers, students, and musicians conceive of creativity? After problematizing standard definitions and ontological ideas of musical creativity, I outline an open model using the poststructuralist philosophy of Deleuze and Guattari. Expanding upon Deleuze and Guattari’s idea of mapping and tracing, this open model describes creativity as a continual process of exploration and rethinking, (...) with or without full understanding of the paths of previous luminaries in the domain of Western classical music. The model further suggests that creativity might blossom from the soil of individual and group experience, regardless of expertise level, according to two conditions: awareness and imagination. Awareness describes the consciousness of creating using available materials, regardless of intention; imagination is defined as the difference between repeating what is and having the curiosity, willingness, and excitement to burst forth towards the possibility of what might be. In conclusion, this paper considers how this model might work in practice, considering especially how an open model might work alongside a pedagogy of systematic string technique. (shrink)

It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric concept. This leaves us wondering if there is any stable family of implications that can be safely called geometric. In this paper, we will first recall the abstract notion of implication as a binary modality introduced in Akbar Tabatabai (Implication (...) via spacetime. In: Mathematics, logic, and their philosophies: essays in honour of Mohammad Ardeshir, pp 161–216, 2021). Then, we will use a weaker version of categorical fibrations to define the geometricity of a category of pairs of spaces and implications over a given category of spaces. We will identify the greatest geometric category over the subcategories of open-irreducible (closed-irreducible) maps as a generalization of the usual injective open (closed) maps. Using this identification, we will then characterize all geometric categories over a given category $${\mathcal {S}}$$ S, provided that $${\mathcal {S}}$$ S has some basic closure properties. Specially, we will show that there is no non-trivial geometric category over the full category of spaces. Finally, as the implications we identified are also interesting in their own right, we will spend some time to investigate their algebraic properties. We will first use a Yoneda-type argument to provide a representation theorem, making the implications a part of an adjunction-style pair. Then, we will use this result to provide a Kripke-style representation for any arbitrary implication. (shrink)

The scientific study of consciousness, also referred to as consciousness science, is a young scientific field devoted to understanding how conscious experiences and the brain relate. It comprises a host of theories, experiments, and analyses that aim to investigate the problem of consciousness empirically, theoretically, and conceptually. This thesis addresses some of the questions that arise in these investigations from a formal and mathematical perspective. These questions concern theories of consciousness, experimental paradigms, methodology, and artificial consciousness. -/- Regarding theories of (...) consciousness, the thesis contributes to the understanding of the mathematical structure that some of the formal theories in the field propose. The work presented here targets the theory of consciousness known as Integrated Information Theory (IIT) and the neuroscientific theory known as Predictive Processing Theory or Free Energy Principle in its Active Inference form (AI-PP). The thesis provides axiomatic definitions of the mathematical structures that constitute these theories, and uses these definitions to address some of the open questions surrounding the theories. For AI-PP, this includes a rigorous derivation of the formula for Active Inference via Free Energy minimisation and a proof of compositionality of Free Energy. For IIT, this includes resolutions of some of the criticisms of IIT's formal scope and applications, but also the identification of new issues that concern the formalism and its derivation. When possible, the definitions are provided in the mathematical framework of category theory. -/- Regarding experiments, the thesis addresses the main paradigm for testing and falsifying theories of consciousness currently applied in the field. This paradigm consists of comparing the conscious experience that a theory predicts with the conscious experience that is inferred from behavioural data or report by use of measures of consciousness. The thesis provides a formal model of this paradigm and shows that under a certain condition—if inference and prediction are independent—, any minimally informative theory of consciousness can always be falsified. This is deeply problematic since the field’s reliance on report or behaviour to infer conscious experiences, in conjunction with the general structure of most contemporary theories of consciousness, implies such independence. This observation provides the exact formal underpinning of the well-known unfolding argument. The thesis analyses the origin of the problem and identifies precisely which changes are required to avoid this problem in future research. The thesis furthermore shows that the problem of falsifying theories of consciousness, and of empirical comparisons of theories of consciousness more generally, follows from a pervasive closure paradigm in consciousness science, that consists of taking a neuroscientific account of the brain as input to a theory of consciousness, so as to explain what consciousness is, without allowing for modifications or adaptations of the neuroscientific account that would accommodate consciousness as part of the brain's functioning. As is shown in the thesis, this paradigm has implications that point to a fundamental need of revision. -/- Regarding methodological and conceptual questions, the thesis contributes to the foundations of structural research in consciousness science. Structural research aims to use mathematical structures or mathematical spaces, instead of verbal descriptions or simple categorisations, to represent conscious experiences scientifically, for example when building theories of consciousness, or when exploring new empirical avenues to measure consciousness. Despite considerable advances in this realm, there was, prior to this thesis, no explicit definition of what a mathematical structure of conscious experience should be; that is, how the attribution of mathematical structure to conscious experiences should be systematically understood. Perhaps the most important contribution of this thesis to the field is to propose such a definition. The definition, a structural concept, extends existing approaches wherever available, and provides a basis for developing a common formal language to study consciousness, bridging developments as far apart as psychophysics and phenomenology. In addition, and independently of this proposal, the thesis offers a critical analysis of which metaphysical premises need to be presumed in structural research, whether the use of particular formal tools (such as structure-preserving mappings or homomorphisms) is justified, and how structural theories of consciousness could otherwise be built in the first place. An attempt to expand the results from consciousness to more general problems in philosophy of science is made in the context of the well-known Newman problem. -/- Regarding the question of artificial consciousness—can AI feel?—, the thesis contributes two results that take the form of no-go theorems, as known from physics. The first no-go theorem shows that if consciousness is relevant for the temporal evolution of a system's states—if it is dynamically relevant—, then contemporary AI systems cannot be conscious. That is because AI systems run on CPUs, GPUs, TPUs or other processors which have been designed and verified to adhere to computational dynamics that systematically preclude or suppress deviations. The second no-go theorem is situated in the context of computational functionalism, a view which posits that consciousness is a computation. The theorem shows that if computational functionalism holds true, consciousness cannot be a Turing computation. Rather, it must be a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation. -/- This thesis is part of a global effort to pioneer a mathematical perspective in consciousness science, now called Mathematical Consciousness Science. The hope behind the research carried out in this PhD is to illustrate the power and usefulness of mathematical approaches in different areas of consciousness science, and in doing so, to lay the foundations for future mathematical work that complements and supports empirical and theoretical work in the further development of this exciting field. (shrink)

The Theme. Strong forcing axioms like Martin’s Maximum give a reasonably satisfactory structural analysis of $H(\omega _2)$. A broad program in modern Set Theory is searching for strong forcing axioms beyond $\omega _1$. In other words, one would like to figure out the structural properties of taller initial segments of the universe. However, the classical techniques of forcing iterations seem unable to bypass the obstacles, as the resulting forcings axioms beyond $\omega _1$ have not thus far been strong enough! However, (...) with his celebrated work on generalised side conditions, I. Neeman introduced us to a novel paradigm to iterate forcings. In particular, he could, among other things, reprove the consistency of the Proper Forcing Axiom using an iterated forcing with finite supports. In 2015, using his technology of virtual models, Veličković built up an iteration of semi-proper forcings with finite supports, hence reproving the consistency of Martin’s Maximum, an achievement leading to the notion of a virtual model.In this thesis, we are interested in constructing forcing notions with finitely many virtual models as side conditions to preserve three uncountable cardinals. The thesis constitutes six chapters and three appendices that amount to 118 pages, where Section 1 is devoted to preliminaries, and Section 2 is a warm-up about the scaffolding poset of a proper forcing. In Section 3, we present the general theory of virtual models in the context of forcing with sets of models of two types, where we, e.g., define the “meet” between two virtual models and prove its properties.The main results are joint with Boban Veličković, and partly appeared in Guessing models and the approachability ideal, J. Math. Log. 21 (2021).Pure Side Conditions. In Section 4, we use two types of virtual models (countable and large non-transitive ones induced by a supercompact cardinal, which we call Magidor models) to construct our forcing with pure side conditions. The forcing covertly uses a third type of models that are transitive. We also add decorations to the conditions to add many clubs in the generic $\omega _2$. In contrast to Neeman’s method, we do not have a single chain, but $\alpha $ -chains, for an ordinal $\alpha $ with $V_\alpha \prec V_\lambda $. Thus, starting from suitable large cardinals $\kappa <\lambda $, we construct a forcing notion whose conditions are finite sets of virtual models described earlier. The forcing is strongly proper, preserves $\kappa $, and has the $\lambda $ -Knaster property. The relevant quotients of the forcing are strongly proper, which helps us prove strong guessing model principles. The construction is generalisable to a ${<}\mu $ -closed forcing, for any given cardinal $\mu $ with $\mu ^{<\mu }=\mu <\kappa $.The Iteration Theorem. In Section 5, we use the forcing with pure side conditions to iterate a subclass of proper and $\aleph _2$ -c.c. forcings and obtain a forcing axiom at the level of $\aleph _2$. The iterable class is closely related to Asperó–Mota’s forcing axiom for finitely proper forcings.Guessing Model Principles. Section 6 encompasses the main parts of the thesis. We prove the consistency of the guessing principle $\mathrm {GMP}^+(\omega _3,\omega _1)$ that states for any cardinal ${\theta \geq \omega _3}$, the set of $\aleph _2$ -sized elementary submodels M of $H(\theta )$, which are the union of an $\omega _1$ -continuous $\in $ -chain of $\omega _1$ -guessing, I.C. models is stationary in $\mathcal P_{\omega _3}(H(\theta ))$. The consistency and consequences of this principle are demonstrated in the following diagram. We also prove that one can obtain the above guessing models in a way that the $\omega _1$ -sized $\omega _1$ -guessing models remain $\omega _1$ -guessing model in any outer transitive model with the same $\omega _1$, and we denote this principle by $\rm{SGMP}^+(\omega_3,\omega_1)$.In the following diagram, $\mathrm{TP}$ stands for the tree property; $w\mathrm{KH}$ stands for the weak Kurepa Hypothesis; $\mathrm{MP}$ stands for Mitchell property, i.e., the approachability ideal is trivial modulo the nonstationary ideal; $\mathrm{AP}$ stands for the approachability property; $\mathrm {AMTP}(\kappa ^+)$ states that if $2^\kappa <\aleph _{\kappa ^+}$, then every forcing which adds a new subset of $\kappa ^+$ whose initial segments are in the ground model, collapses some cardinal $\leq 2^{\kappa }$. The dotted arrow denotes the relative consistency, while others are logical implications.Appendices. Appendix A includes merely the above diagram. Appendix B presents a proof of the Mapping Reflection Principle with finite conditions under $\mathrm {PFA}$. Appendix C contains open problems. Finally, the thesis’s bibliography consists of 42 items.Abstract prepared by Rahman MohammadpourE-mail: [email protected]: https://theses.hal.science/tel-03209264. (shrink)

We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm {ATR_0}$ from the point of view of reverse mathematics, there is not a canonical way to phrase them as multivalued functions. We identify eight different multivalued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility. In particular one of our functions turns out to be (...) strictly stronger than any previously studied multivalued functions arising from statements around $\mathrm {ATR}_0$. (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

Giovanni Sambin has recently introduced the notion of an overlap algebra in order to give a constructive counterpart to a complete Boolean algebra. We propose a new notion of regular open subset within the framework of intuitionistic, predicative topology and we use it to give a representation theorem for overlap algebras. In particular we show that there exists a duality between the category of set-based overlap algebras and a particular category of topologies in which all open subsets (...) are regular. (shrink)

The concept of neutrosophic locally compact and neutrosophic compact open topology are introduced and some interesting propositions are discussed.

In the current scientific and political discourse surrounding the transformation of the scientific publication system, significant attention is focused on Diamond Open Access (OA). Diamond OA is characterized by no charges for readers or authors and relies on monetary allowances and voluntary work. This article explores the potential and challenges of Diamond OA journals, using Germany as a case study. Two key questions are addressed: first, the current role of such journals in the scientific publication system is determined through (...) bibliometric analysis across various disciplines. Second, an investigation is conducted to assess the sustainability of Diamond OA journals and identify associated structural problems or potential breaking points. This investigation includes an in-depth expert interview study involving 20 editors of Diamond OA journals. The empirical results are presented using a landscape map that considers two dimensions: 'monetized and gift-based completion of tasks' and 'journal team size.' The bibliometric analysis reveals a substantial number of Diamond OA journals in the social sciences and humanities, but limited adoption in other fields. The model proves effective for small to mid-sized journals, but not for larger ones. Additionally, it was found that 23 Diamond OA journals have recently discontinued their operations. The expert interviews demonstrate the diversity within the landscape and the usefulness of the two dimensions in understanding key differences. Journals in two of the four quadrants of the map exemplify sustainable conditions, while the other two quadrants raise concerns about long-term stability. These concerns include limited funding leading to a lack of division of labor and an excessive burden on highly committed members. Gift-like contributions, while appealing, also present challenges as potential donors not only decide whether to contribute but also how to contribute, potentially creating friction between the gift and the journal's requirements. Furthermore, journals in the lower right quadrant often rely on third-party funding, necessitating a transformation once the funding expires. Common pathways for sustaining operations include lobbying for funding at the journal's home institution or increasing reliance on gift-based completion of tasks. These findings underscore the need for the development of more sustainable funding models to ensure the success of Diamond OA journals. (shrink)

Richard Dedekind’s theorem 66 states that there exists an infinite set. Its proof invokes such apparently nonmathematical notions as the thought-world and the self. This article discusses the content and context of Dedekind’s proof. It is suggested that Dedekind took the notion of the thought-world from Hermann Lotze. The influence of Kant and Bernard Bolzano on the proof is also discussed, and the reception of the proof in the mathematical and philosophical literature is covered in detail.

This article describes how the City of Los Angeles is showcasing data-driven services to the public through dynamic visualisations of open data. I frame an analysis of this aspect of datafication in local government through linguistics and cultural theory; drawing on this set of literature I theorise the use of public data as both a performative tool and a performance of data-driven city services. I then discuss examples of interactive maps on the City of Los Angeles’ open data (...) websites, produced by the Bureau of Sanitation, the Controller’s Office, and the Department of Transportation. The article concludes with some general thoughts on how open data maps are a new form of impression management; they set up a relationship in which government and citizens are in alignment, sharing an orientation towards administrative problems that begins at the same point, framed by an administration’s datasets. (shrink)

Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims to bridge the gap between interactive and automated theorem proving, by situating automated tools and methods in a framework that supports user interaction and the construction of fully specified axiomatic proofs. Lean is an ongoing and long-term effort, but it already provides many useful components, integrated development environments, and (...) a rich API which can be used to embed it into other systems. It is currently being used to formalize category theory, homotopy type theory, and abstract algebra. We describe the project goals, system architecture, and main features, and we discuss applications and continuing work. (shrink)

Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. They (...) seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

This article presents two theorems: a generalization of Löb’s Theorem that applies to formal proof systems operating with bounded computational resources, such as formal verification software or theorem provers, and a theorem on the robust cooperation of agents that employ proofs about one another’s source code as unexploitable criteria for cooperation. The latter illustrates a capacity for outperforming classical Nash equilibria and correlated equilibria, attaining mutually cooperative program equilibrium in the Prisoner’s Dilemma while remaining unexploitable, i.e., sometimes (...) achieving the outcome, and never receiving the outcome as player 1. (shrink)

We discuss some of the relationships between the notion of "mutual stationarity" of Foreman and Magidor and measurability in inner models. The general thrust of these is that very general mutual stationarity properties on small cardinals, such as the ℵns, is a large cardinal property. A number of open problems, theorems, and conjectures are stated.

Several important physical implications left out in The Five Dimension Space-Time Universe: A creation and grand unified field theory model. Book, are presented under rigorous mathematical theorems. It was found that Temperature, a classical variable, must be added as an imaginary component to time, under the Quantum uncertainty dt∙dE = h/2π, so that the Gell-Mann Quark model can be verified, with gauge invariance, to form hadrons at the Bethe Fusion Temperature. Accordingly from the corresponding uncertainty dp∙dr = h/2π. Pairs of (...) Diagonal Long Range Ordered gravitons, with continuous frequency spectrum together with those represented by magnetic monopoles must be formed within the space r, of the homogenous 5D manifold, without the presents of photons, thus defines the 5D as a Black Hole. Then from which we can derive the classical Newtonian Law of attractive Gravity, as the 5D manifold is mapped by Perelmann Ricci-flow entropy mapping and the DLRO graviton pair symmetry is broken and converted into two masses, with motions satisfying Special Relativity in the doughnut shape Lorentz manifold, thus indirectly verifies the principle of Covariant Riemannian curvatures and General Relativity theory. (shrink)

A topological class logic is an infinitary logic formed by combining a first-order logic with the quantifier symbols O and C. The meaning of a formula closed by quantifier O is that the set defined by the formula is open. Similarly, a formula closed by quantifier C means that the set is closed. The corresponding models are a topological class spaces introduced by Ćirić and Mijajlović (Math Bakanica 1990). The completeness theorem is proved.

An open formalism for arithmetic is presented based on first-order logic supplemented by a very strictly controlled constructive form of the omega-rule. This formalism (which contains Peano Arithmetic) is proved (nonconstructively, of course) to be complete. Besides this main formalism, two other complete open formalisms are presented, in which the only inference rule is modus ponens. Any closure of any theorem of the main formalism is a theorem of each of these other two. This fact is (...) proved constructively for the stronger of them and nonconstructively for the weaker one. There is, though, an interesting counterpart: the consistency of the weaker formalism can be proved finitarily. (shrink)

It is clear now that open education is much more than a binary consideration of open versus closed but also includes "opening." This book maps a range of different theoretical and practice-oriented approaches and proposals to (re)considering open education.

Context: Although second-order cybernetics was proposed as a new way of cybernetic investigations around 1970, its general status and its modus operandi are still far from obvious. Problem: We want to provide a new perspective on the scope and the currently available potential of second-order cybernetics within today’s science landscapes. Method: We invited a group of scholars who have produced foundational work on second-order cybernetics in recent years, and organized an open call for new approaches to second-order cybernetics. The (...) accepted contributions are discussed and mapped. We also investigate the relations between second-order cybernetics and second-order science. Results: We present a coherent outlook on the scope of second-order cybernetics today, identify a general methodology of science and show that second-order cybernetics can be used in a large number of disciplines that go well beyond purely scientific domains. These results are based on a new epistemic mode “from within,” which can be traced back directly to von Foerster. We also arrived at the conclusion that from its early years onwards second-order cybernetics was developed in two different ways, so that second-order cybernetics and second-order science operate in different domains. Implications: Both the coherent perspective of the scope of second-order cybernetics with a new five-part agenda and the outline for a general methodology of science based on a new epistemic mode that was created within and for second-order cybernetics demonstrate the growing importance of reflexivity in science, which, so far, has not been widely recognized. (shrink)

Hay and, then, Johnson extended the classic Rice and Rice-Shapiro Theorems for computably enumerable sets, to analogs for all the higher levels in the finite Ershov Hierarchy. The present paper extends their work to analogs in the transfinite Ershov Hierarchy. Some of the transfinite cases are done for all transfinite notations in Kleene's important system of notations, equation image. Other cases are done for all transfinite notations in a very natural, proper subsystem equation image of equation image, where equation image (...) has at least one notation for each constructive ordinal. In these latter cases it is open as to what happens for the entire set of transfinite notations in equation image. (shrink)

We prove a partition theorem for analytic sets, namely, if X is an analytic set in a Polish space and [X]n = K0 ∪ K1 with K0 open in the relative topology, and the partition satisfies a finitary condition, then either there is a perfect K0-homogeneous subset or X is a countable union of K1-homogeneous subsets. We also prove a partition theorem for analytic sets in the three-dimensional case. Finally, we give some applications of the theorems.

Mental health research faces a suite of unresolved challenges that have contributed to a stagnation of research efforts and treatment innovation. One such challenge is how to reliably and validly account for the subjective side of patient symptomatology, that is, the patient’s inner experiences or patient phenomenology. Providing a structured, standardised semantics for patient phenomenology would enable future research in novel directions. In this contribution, we aim at initiating a standardized approach to patient phenomenology by sketching a tentative formalisation within (...) the framework of an applied ontology, in the broader context of existing open-source Open Biomedical Ontologies resources such as the Mental Functioning Ontology. We further discuss a number of prevailing challenges and observations bearing on this task. (shrink)