We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König's Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multivalued function Sep and a natural notion of reducibility for multivalued functions, we obtain a computational counterpart of the subsystem of second-order arithmetic WKL0. We study analogies and differences between (...) WKL0 and the class of Sep-computable multivalued functions. Extending work of Brattka, we show that a natural multivalued function associated with the Hahn-Banach Extension Theorem is Sep-complete. (shrink)

The classical Hahn–Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari Downey, Ishihara and others and it is known that the theorem does not admit a general computable version. We prove a new computable version of this theorem (...) without unrolling the classical proof of the theorem itself. More precisely, we study computability properties of the uniform extension operator which maps each functional and subspace to the set of corresponding extensions. It turns out that this operator is upper semi-computable in a well-defined sense. By applying a computable version of the Banach–Alaoglu Theorem we can show that computing a Hahn–Banach extension cannot be harder than finding a zero in a compact metric space. This allows us to conclude that the Hahn–Banach extension operator is ${\bf {\Sigma^{0}_{2}}}$ -computable while it is easy to see that it is not lower semi-computable in general. Moreover, we can derive computable versions of the Hahn–Banach Theorem for those functionals and subspaces which admit unique extensions. (shrink)

We work in set theory ZF without axiom of choice. Though the Hahn-Banach theorem cannot be proved in ZF, we prove that every Gateaux-differentiable uniformly convex Banach space E satisfies the following continuous Hahn-Banach property: if p is a continuous sublinear functional on E, if F is a subspace of E, and if f: F → ℝ is a linear functional such that f ≤ p|F then there exists a linear functional g : E (...) → ℝ such that g extends f and g ≤ p. We also prove that the continuous Hahn-Banach property on a topological vector space E is equivalent to the classical geometrical forms of the Hahn-Banach theorem on E. We then prove that the axiom of Dependent choices DC is equivalent to Ekeland's variational principle, and that it implies the continuous Hahn-Banach property on Gateaux-differentiable Banach spaces. Finally, we prove that, though separable normed spaces satisfy the continuous Hahn-Banach property, they do not satisfy the whole Hahn-Banach property in ZF+DC. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non-compact CSM. Both results rely on having (...) careful constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non-compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non-compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion-theoretic setting, then, for any such space X, there exists a Banach-Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space (CSM) without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non‐compact CSM. Both results rely on (...) having careful constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non‐compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non‐compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion‐theoretic setting, then, for any such space X, there exists a Banach‐Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

In set theory without the axiom of choice math formula, three-space type results for the Hahn-Banach property are provided. We deduce that for every Hausdorff compact scattered space K, the Banach space C of real continuous functions on K satisfies the continuous Hahn-Banach property in math formula. We also prove in math formula Rudin's theorem: “Radon measures on Hausdorff compact scattered spaces are discrete”.

We construct an algebra of generalized functions endowed with a canonical embedding of the space of Schwartz distributions.We offer a solution to the problem of multiplication of Schwartz distributions similar to but different from Colombeau’s solution.We show that the set of scalars of our algebra is an algebraically closed field unlike its counterpart in Colombeau theory, which is a ring with zero divisors. We prove a Hahn–Banach extension principle which does not hold in Colombeau theory. We establish (...) a connection between our theory with non-standard analysis and thus answer, although indirectly, a question raised by Colombeau. This article provides a bridge between Colombeau theory of generalized functions and non-standard analysis. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space (CSM) without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non‐compact CSM. Both results rely on (...) having careful constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non‐compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non‐compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion‐theoretic setting, then, for any such space X, there exists a Banach‐Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

In the last two decades, WORDNET has evolved as the most comprehensive computational lexicon of general English. In this article, we discuss its potential for supporting the creation of an entirely new kind of information resource for public health, viz. MEDICAL WORDNET. This resource is not to be conceived merely as a lexical extension of the original WORDNET to medical terminology; indeed, there is already a considerable degree of overlap between WORDNET and the vocabulary of medicine. Instead, we propose (...) a new type of repository, consisting of three large collections of (1) medically relevant word forms, structured along the lines of the existing Princeton WORDNET; (2) medically validated propositions, referred to here as medical facts, which will constitute what we shall call MEDICAL FACTNET; and (3) propositions reflecting laypersons’ medical beliefs, which will constitute what we shall call the MEDICAL BELIEFNET. We introduce a methodology for setting up the MEDICAL WORDNET. We then turn to the discussion of research challenges that have to be met in order to build this new type of information resource. (shrink)

Metaphysics, geometry, and the problems with diagrams -- The Pythagorean theorem: Euclid I.47 and VI.31 -- Thales and geometry: Egypt, Miletus, and beyond -- Pythagoras and the famous theorems -- From the Pythagorean theorem to the construction of the cosmos out of right triangles.

In recent years, the receipt and the perception of information has changed in ways which have fueled fears about the fates of our democracies. However, real information on these possibilities or the direction of these changes does not exist. Into this gap, Hahn and colleagues bring the power of Condorcet's (1785) Jury Theorem to show that changes in our information networks have affected voter inter‐dependence so that it is likely that voters are now collectively more ignorant even if (...) individual voter competence remains unchanged. (shrink)

Collaborative consumption is proposed as a potential step beyond unsustainable linear consumption patterns toward more sustainable consumption practices. Despite mounting interest in the topic, little is known about the determinants of this consumer behavior. We use an extended theory of planned behavior to examine the relative influence of consumers’ personal norms and the theory’s basic sociopsychological variables attitudes, subjective norms, and perceived behavioral control on collaborative consumption. Moreover, we use this framework to examine consumers’ underlying value and belief structure regarding (...) collaborative consumption. We measure these aspects for 224 consumers in a survey and then assess their self-reported collaborative consumption behavior in a second survey. Our structural model fits the data well. Collaborative consumption is more strongly—through intentions—influenced by personal norms and attitudes than by subjective norms. Personal norms to consume collaboratively are determined by consumers’ altruistic, biospheric, and egoistic value orientations. Cost savings, efficient use of resources, and community with others are found to be consumers’ attitudinal beliefs underlying collaborative consumption. We conclude that collaborative consumption can be pin-pointed neither as a mere form of economic exchange nor as a primarily normative form of sharing resources. Instead, collaborative consumption is determined by economic/egoistic (e.g., cost savings) and normative (e.g., altruistic and biospheric value orientations) motives. Implications for collaborative consumption research, the theory of planned behavior, and practitioners are discussed. (shrink)

In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice. It turns out that parallelization is a closure operator for this semi-lattice and that the parallelized Weihrauch degrees even form a lattice into which the Medvedev lattice and the Turing degrees can be embedded. (...) The importance of Weihrauch degrees is based on the fact that multi-valued functions on represented spaces can be considered as realizers of mathematical theorems in a very natural way and studying the Weihrauch reductions between theorems in this sense means to ask which theorems can be transformed continuously or computably into each other. As crucial corner points of this classification scheme the limited principle of omniscience LPO, the lesser limited principle of omniscience LLPO and their parallelizations are studied. It is proved that parallelized LLPO is equivalent to Weak Kőnig's Lemma and hence to the Hahn—Banach Theorem in this new and very strong sense. We call a multi-valued function weakly computable if it is reducible to the Weihrauch degree of parallelized LLPO and we present a new proof, based on a computational version of Kleene's ternary logic, that the class of weakly computable operations is closed under composition. Moreover, weakly computable operations on computable metric spaces are characterized as operations that admit upper semi-computable compact-valued selectors and it is proved that any single-valued weakly computable operation is already computable in the ordinary sense. (shrink)

Suppose that two competing norms, N1 and N2, can be identified such that a given person’s response can be interpreted as correct according to N1 but incorrect according to N2. Which of these two norms, if any, should one use to interpret such a response? In this paper we seek to address this fundamental problem by studying individual variation in the interpretation of conditionals by establishing individual profiles of the participants based on their case judgments and reflective attitudes. To investigate (...) the participants’ reflective attitudes we introduce a new experimental paradigm called the Scorekeeping Task. As a case study, we identify the participants who follow the Suppositional Theory of conditionals (N1) versus Inferentialism (N2) and investigate to what extent internally consistent competence models can be reconstructed for the participants on this basis. After extensive empirical investigations, an apparent reasoning error with and-to-if inferences was found in one of these two groups. The implications of this case study for debates on the proper role of normative considerations in psychology are discussed. (shrink)

Essays by various philosphers on the work of Tyler Burge and Burge's extensive responses.

Kumaraswamy Vela Velupillai [74] presents a constructivist perspective on the foundations of mathematical economics, praising the views of Feynman in developing path integrals and Dirac in developing the delta function. He sees their approach as consistent with the Bishop constructive mathematics and considers its view on the Bolzano-Weierstrass, Hahn-Banach, and intermediate value theorems, and then the implications of these arguments for such “crown jewels” of mathematical economics as the existence of general equilibrium and the second welfare theorem. (...) He also relates these ideas to the weakening of certain assumptions to allow for more general results as shown by Rosser [51] in his extension of Gödel’s incompleteness theorem in his opening section. This paper considers these arguments in reverse order, moving from the matters of economics applications to the broader issue of constructivist mathematics, concluding by considering the views of Rosser on these matters, drawing both on his writings and on personal conversations with him. (shrink)

Companies disclosing negative aspects in sustainability reports often employ legitimation strategies to present mishaps in a favorable light. In incentivized experiments, we find that nonprofessional investors divest from companies with a negative sustainability-related incident, and that symbolic legitimation (which only evasively explains a negative incident) is not a strong enough signal to counter this divestment behavior. Even substantial legitimation (which reports on measures and behavioral change) mitigates the divestment decisions only if the company reports on concrete remediation actions in morally (...) charged situations, such as social or environmental incidents. We elaborate these results in light of signaling and screening theory, and suggest the conceptual extension of “costly signals” to what we call “valuable signals.” We argue that valuable signals need be not only costly for the sender from an economic perspective but also perceived as appropriate by the receiver from a noneconomic perspective. (shrink)

Karl Hahn, Jahrgang 1937, war bis zu seiner Emeritierung im Jahr 2003 Professor für Politische Theorie und Ideengeschichte an der Westfälischen Wilhelms-Universität Münster. Hierbei hat er die Klassiker der abendländischen Geistesgeschichte nicht in einem kanonisch-schematischen Profil gelehrt, sondern die jeweiligen Themen und Theoreme mit lebensfüllender Leidenschaft vermittelt. Seine Vorlesungen und Seminare an der Universität zeugen, wie auch seine Vorträge und Tagungsbeiträge, von einem streitbaren Geist, der stets auch um die aktualisierende Bezugnahme bemüht war. Stets hat er pointiert Stellung bezogen, (...) auch gegen den Mainstream des Faches, das er kritisch hinterfragt hat. Ob Platon, Fichte oder auch Simone Weil: Bei Karl Hahn stehen philosophische Überlegungen für eine Suche nach der Vollendung des Daseins in seinen unendlich vielen und offenen Aussagemöglichkeiten. Hahns großes Lebensthema war und ist hierbei das tragische Element des menschlichen Wesens, dessen Kleinheit und Begrenztheit angesichts der großen Fragen der menschlichen Existenz. Das hat er seinen Studierenden mit auf den Weg gegeben. Und auch den Kolleginnen und Kollegen, die bereit waren, zuzuhören. Mit dem vorliegenden Band wird der Wissenschaftler zum Anlass seines 80. Geburtstages geehrt, der seine Verdienste nicht in der flüchtigen Wertschätzung des Feuilletons, sondern grundsätzlich im Diskurs der Seminarräume und Kongressveranstaltungen erworben hat. (shrink)

This work is to be understood from the systematic perspective as an extension of John Rawl's Theory of Justice. Constituting a normative vanishing-point, the individual's moral self-respect is placed at the centre of the theory's justification. Starting from the thesis that self-respect presents itself as the highestgood, the book defends a number of fundamental moral rights that need to be realized legally, economically, culturally, and politically so that a person can maintain her self-respect.

© The Author 2016. Published by Oxford University Press on behalf of Japanese Society of Plant Physiologists. All rights reserved.Cell walls of grasses, including cereal crops and biofuel grasses, comprise the majority of plant biomass and intimately influence plant growth, development and physiology. However, the functions of many cell wall synthesis genes, and the relationships among and the functions of cell wall components remain obscure. To better understand the patterns of cell wall accumulation and identify genes that act in grass (...) cell wall biosynthesis, we characterized 30 samples from aerial organs of rice at 10 developmental time points, 3-100 d post-germination. Within these samples, we measured 15 cell wall chemical components, enzymatic digestibility and 18 cell wall polysaccharide epitopes/ligands. We also used quantitative reverse transcription-PCR to measure expression of 50 glycosyltransferases, 15 acyltransferases and eight phenylpropanoid genes, many of which had previously been identified as being highly expressed in rice. Most cell wall components vary significantly during development, and correlations among them support current understanding of cell walls. We identified 92 significant correlations between cell wall components and gene expression and establish nine strong hypotheses for genes that synthesize xylans, mixed linkage glucan and pectin components. This work provides an extensive analysis of cell wall composition throughout rice development, identifies genes likely to synthesize grass cell walls, and provides a framework for development of genetically improved grasses for use in lignocellulosic biofuel production and agriculture. (shrink)

We study theorems from Functional Analysis with regard to their relationship with various weak choice principles and prove several results about them: “Every infinite‐dimensional Banach space has a well‐orderable Hamel basis” is equivalent to ; “ can be well‐ordered” implies “no infinite‐dimensional Banach space has a Hamel basis of cardinality ”, thus the latter statement is true in every Fraenkel‐Mostowski model of ; “No infinite‐dimensional Banach space has a Hamel basis of cardinality ” is not provable in (...) ; “No infinite‐dimensional Banach space has a well‐orderable Hamel basis of cardinality ” is provable in ; (the Axiom of Choice for denumerable families of non‐empty finite sets) is equivalent to “no infinite‐dimensional Banach space has a Hamel basis which can be written as a denumerable union of finite sets”; Mazur's Lemma (“If X is an infinite‐dimensional Banach space, Y is a finite‐dimensional vector subspace of X, and, then there is a unit vector such that for all and all scalars α”) is provable in ; “A real normed vector space X is finite‐dimensional if and only if its closed unit ball is compact” is provable in ; (Principle of Dependent Choices) + “ can be well‐ordered” does not imply the Hahn‐Banach Theorem () in ; and “no infinite‐dimensional Banach space has a Hamel basis of cardinality ” are independent from each other in ; “No infinite‐dimensional Banach space can be written as a denumerable union of finite‐dimensional subspaces” lies in strength between (the Axiom of Countable Choice) and ; implies “No infinite‐dimensional Banach space can be written as a denumerable union of closed proper subspaces” which in turn implies ; “Every infinite‐dimensional Banach space has a denumerable linearly independent subset” is a theorem of, but not a theorem of ; and “Every infinite‐dimensional Banach space has a linearly independent subset of cardinality ” implies “every Dedekind‐finite set is finite”. (shrink)

Contrary to what is stated in Lemma 7.1 of [8], it is shown that some Boolean algebras of finitary logic admit finitely additive probabilities that are not σ-additive. Consequences of Lemma 7.1 are reconsidered. The concept of a C-σ-additive probability on B (where B and C are Boolean algebras, and $\mathscr{B} \subseteq \mathscr{C}$ ) is introduced, and a generalization of Hahn's extension theorem is proved. This and other results are employed to show that every S̄(L)-σ-additive probability on (...) s̄(L) can be extended (uniquely, under some conditions) to a σ-additive probability on S̄(L), where L belongs to a quite extensive family of first order languages, and S̄(L) and s̄(L) are, respectively, the Boolean algebras of sentences and quantifier free sentences of L. (shrink)

I show that de Finetti’s coherence theorem is equivalent to the Hahn-Banach theorem and discuss some consequences of this result. First, the result unites two aspects of de Finetti’s thought in a nice way: a corollary of the result is that the coherence theorem implies the existence of a fair countable lottery, which de Finetti appealed to in his arguments against countable additivity. Another corollary of the result is the existence of sets that are not (...) Lebesgue measurable. I offer a subjectivist interpretation of this corollary that is concordant with de Finetti’s views. I conclude by pointing out that my result shows that there is a sense in which de Finetti’s theory of subjective probability is necessarily nonconstructive. This raises questions about whether the coherence theorem can underwrite a legitimate theory of rational belief. (shrink)

We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)

In this paper, we investigate the logical strength of two types of fixed point theorems in the context of reverse mathematics. One is concerned with extensions of the Banach contraction principle. Among theorems in this type, we mainly show that the Caristi fixed point theorem is equivalent to math formula over math formula. The other is dedicated to topological fixed point theorems such as the Brouwer fixed point theorem. We introduce some variants of the Fan-Browder fixed point (...) theorem and the Kakutani fixed point theorem, which we call math formula and math formula, respectively. Then we show that math formula is equivalent to math formula and math formula is equivalent to math formula, over math formula. In addition, we also study the application of the Fan-Browder fixed point theorem to game systems. (shrink)

We prove in set theory without the Axiom of Choice, that Rado’s selection lemma (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document}) implies the Hahn-Banach axiom. We also prove that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document} is equivalent to several consequences of the Tychonov theorem for compact Hausdorff spaces: in particular, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document} implies that every filter on a well orderable set is included (...) in a ultrafilter. In set theory with atoms, the “Multiple Choice” axiom implies \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document}. (shrink)

We show that the maximal linear extension theorem for well partial orders is equivalent over RCA0 to ATR0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR0 over RCA0.

This paper aims to give a correct proof of Tait's conservative extension theorem. Tait's own proof is flawed in the sense that there are some invalid steps in his argument, and there is a counterexample to the main theorem from which the conservative extension theorem is supposed to follow. However, an analysis of Tait's basic idea suggests a correct proof of the conservative extension theorem and a corrected version of the main theorem.

Hahn’s embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn’s theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative residuated chains which possess only finitely many idempotent elements. To this end, the partial lexicographic product construction is introduced to construct new odd involutive commutative residuated lattices from a pair of odd involutive commutative residuated lattices, and a representation theorem for (...) odd involutive commutative residuated chains which possess only finitely many idempotent elements, by means of linearly ordered abelian groups and the partial lexicographic product construction is presented. (shrink)

This paper extends the classical extension theorem established by Edward Szpilrajn (Fundamenta Mathematicae, 16, pp. 386–389, 1930). Szpilrajn's theorem states that every quasi‐ordering has an ordering extension. Because of its usefulness in various themes of economics, it has been applied by many researchers. Important generalizations have been presented by two authors, Kenneth Arrow and Kotaro Suzumura, among others. First, we provide concise proofs of four extension theorems by Szpilrajn, Arrow and Suzumura. We then show an (...) extension of their extension theorems. (shrink)

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...) principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (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)

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 extend Gurevich-Harrington's Restricted Memory Determinacy Theorem), which served in their paper as a tool to give their celebrated “short proof” of Robin's decision method for S2S. We generalize the determinacy problem by attaching to the game two opposing strategies called restraints, and by asking “which player has a strategy which is a refinement of the restraint for the player and such that it wins the game against the restraint of the opponent?” We give a solution for the Determinacy (...) with Restraints Problem in the class of strategies with restricted memory for the GH games. The solution includes a criterion for the winning player and an explicit class of winning strategies. A determinacy result which includes similar information was first discovered by Büchi and Landweber and extended by Büchi . However, these pioneering works do not consider the determinacy with restraints. Also, the explicit presentation of winning strategies in these insightful papers does not emphasize their modular construction as do GH's and our proofs. In our view, this is a source of a difficulty in understanding these papers. Games with restraints and modular construction of winning strategies have applications to the semantics, development and verification of concurrent programs. A concurrent program can be viewed as a strategy in a certain game and a program specification can be regarded as a combination of a winning condition and restraints for the game , A. Yakhnis and V. Yakhnis ). The modularity of a winning strategyfor the game helps to generate a concurrent program from the strategy that satisfies the specification ). It turns out that such program specification requirements as mutual exclusion and an absence of a lockout or a deadlock are naturally represented as Büchi's or Gurevich-Harrington's winning conditions. The present paper can be read independently of the paper by Gurevich and Harrington. (shrink)

R. M. Friedberg demonstrated the existence of a recursive functional that agrees with no Banach-Mazur functional on the class of recursive functions. In this paper Friedberg's result is generalized to both α-recursive functionals and weak α-recursive functionals for all admissible ordinals α such that $\lambda , where α * is the Σ 1 -projectum of α and λ is the Σ 2 -cofinality of α. The theorem is also established for the metarecursive case, α = ω 1 , (...) where α * = λ = ω. (shrink)

We show that if $$ satisfies the first-order Zermelo–Fraenkel axioms of set theory when the membership relation is ${ \in _1}$ and also when the membership relation is ${ \in _2}$, and in both cases the formulas are allowed to contain both ${ \in _1}$ and ${ \in _2}$, then $\left \cong \left$, and the isomorphism is definable in $$. This extends Zermelo’s 1930 theorem in [6].

Dummett's logic LC quantified, Q-LC, is shown to be characterized by the extended frame Q+, ,D, where Q+ is the set of non-negative rational numbers, is the numerical relation less or equal then and D is the domain function such that for all v, w Q+, Dv and if v w, then D v . D v D w . Moreover, simple completeness proofs of extensions of Q-LC are given.

LetKbe an algebraic number field andIKthe ring of algebraic integers inK. *Kand *IKdenote enlargements ofKandIKrespectively. LetxЄ *K–K. In this paper, we are concerned with algebraic extensions ofKwithin *K. For eachxЄ *K–Kand each natural numberd, YKis defined to be the number of algebraic extensions ofKof degreedwithin *K.xЄ *K–Kis called a Hilbertian element ifYK= 0 for alldЄ N,d> 1; in other words,Khas no algebraic extension within *K. In their paper [2], P. C. Gilmore and A. Robinson proved that the existence of (...) a Hilbertian element is equivalent to Hilbert's irreducibility theorem. In a previous paper [9], we gave many Hilbertian elements of nonstandard integers explicitly, for example, for any nonstandard natural numberω, 2ωPωand 2ω are Hilbertian elements in*Q, where pωis theωth prime number. (shrink)