37 found
Order:
  1.  56
    Handbook of Constructive Mathematics.Douglas Bridges, Hajime Ishihara, Michael Rathjen & Helmut Schwichtenberg (eds.) - 2023 - Cambridge: Cambridge University Press.
    Constructive mathematics – mathematics in which ‘there exists’ always means ‘we can construct’ – is enjoying a renaissance. Fifty years on from Bishop’s groundbreaking account of constructive analysis, constructive mathematics has spread out to touch almost all areas of mathematics and to have profound influence in theoretical computer science. This handbook gives the most complete overview of modern constructive mathematics, with contributions from leading specialists surveying the subject’s myriad aspects. Major themes include: constructive algebra and geometry, constructive analysis, constructive topology, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  76
    Continuity properties in constructive mathematics.Hajime Ishihara - 1992 - Journal of Symbolic Logic 57 (2):557-565.
    The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We deal with principles which are equivalent to the statements "every mapping is sequentially nondiscontinuous", "every sequentially nondiscontinuous mapping is sequentially continuous", and "every sequentially continuous mapping is continuous". As corollaries, we show that every mapping of a complete separable space is continuous in constructive recursive mathematics (the Kreisel-Lacombe-Schoenfield-Tsejtin theorem) and in intuitionism.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  3.  46
    (1 other version)An omniscience principle, the König Lemma and the Hahn‐Banach theorem.Hajime Ishihara - 1990 - Mathematical Logic Quarterly 36 (3):237-240.
  4.  70
    Continuity and nondiscontinuity in constructive mathematics.Hajime Ishihara - 1991 - Journal of Symbolic Logic 56 (4):1349-1354.
    The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We show that every mapping is sequentially continuous if and only if it is sequentially nondiscontinuous and strongly extensional, and that "every mapping is strongly extensional", "every sequentially nondiscontinuous mapping is sequentially continuous", and a weak version of Markov's principle are equivalent. Also, assuming a consequence of Church's thesis, we prove a version of the Kreisel-Lacombe-Shoenfield-Tsĕitin theorem.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  5.  69
    Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
    Classically, weak König's lemma and Brouwer's fan theorem for detachable bars are equivalent. We give a direct constructive proof that the former implies the latter.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  6.  77
    Brouwer's fan theorem and unique existence in constructive analysis.Josef Berger & Hajime Ishihara - 2005 - Mathematical Logic Quarterly 51 (4):360-364.
    Many existence propositions in constructive analysis are implied by the lesser limited principle of omniscience LLPO; sometimes one can even show equivalence. It was discovered recently that some existence propositions are equivalent to Bouwer's fan theorem FAN if one additionally assumes that there exists at most one object with the desired property. We are providing a list of conditions being equivalent to FAN, such as a unique version of weak König's lemma. This illuminates the relation between FAN and LLPO. Furthermore, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  7.  40
    Some principles weaker than Markov’s principle.Makoto Fujiwara, Hajime Ishihara & Takako Nemoto - 2015 - Archive for Mathematical Logic 54 (7-8):861-870.
    We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle. We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8.  52
    Strong continuity implies uniform sequential continuity.Douglas Bridges, Hajime Ishihara, Peter Schuster & Luminiţa Vîţa - 2005 - Archive for Mathematical Logic 44 (7):887-895.
    Uniform sequential continuity, a property classically equivalent to sequential continuity on compact sets, is shown, constructively, to be a consequence of strong continuity on a metric space. It is then shown that in the case of a separable metric space, uniform sequential continuity implies strong continuity if and only if one adopts a certain boundedness principle that, although valid in the classical, recursive and intuitionistic setting, is independent of Heyting arithmetic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  9.  45
    The binary expansion and the intermediate value theorem in constructive reverse mathematics.Josef Berger, Hajime Ishihara, Takayuki Kihara & Takako Nemoto - 2019 - Archive for Mathematical Logic 58 (1-2):203-217.
    We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval ) is equivalent to weak König lemma ) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to \ for convex trees, in the framework of constructive reverse mathematics.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  39
    A note on the independence of premiss rule.Hajime Ishihara & Takako Nemoto - 2016 - Mathematical Logic Quarterly 62 (1-2):72-76.
    In this note, we prove that certain theories of (many‐sorted) intuitionistic predicate logic are closed under the independence of premiss rule (IPR). As corollaries, we show that and extended by some non‐classical axioms and non‐constructive axioms are closed under IPR.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  42
    Embedding classical in minimal implicational logic.Hajime Ishihara & Helmut Schwichtenberg - 2016 - Mathematical Logic Quarterly 62 (1-2):94-101.
    Consider the problem which set V of propositional variables suffices for whenever, where, and ⊢c and ⊢i denote derivability in classical and intuitionistic implicational logic, respectively. We give a direct proof that stability for the final propositional variable of the (implicational) formula A is sufficient; as a corollary one obtains Glivenko's theorem. Conversely, using Glivenko's theorem one can give an alternative proof of our result. As an alternative to stability we then consider the Peirce formula. It is an easy consequence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  78
    On constructing completions.Laura Crosilla, Hajime Ishihara & Peter Schuster - 2005 - Journal of Symbolic Logic 70 (3):969-978.
    The Dedekind cuts in an ordered set form a set in the sense of constructive Zermelo—Fraenkel set theory. We deduce this statement from the principle of refinement, which we distill before from the axiom of fullness. Together with exponentiation, refinement is equivalent to fullness. None of the defining properties of an ordering is needed, and only refinement for two—element coverings is used. In particular, the Dedekind reals form a set; whence we have also refined an earlier result by Aczel and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  13.  94
    (2 other versions)A constructive look at the completeness of the space (ℝ).Hajime Ishihara & Satoru Yoshida - 2002 - Journal of Symbolic Logic 67 (4):1511-1519.
    We show, within the framework of Bishop's constructive mathematics, that (sequential) completeness of the locally convex space $\mathcal{D} (\mathbb{R})$ of test functions is equivalent to the principle BD-N which holds in classical mathemtatics, Brouwer's intuitionism and Markov's constructive recursive mathematics, but does not hold in Bishop's constructivism.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  14.  39
    Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice.Hajime Ishihara, Maria Emilia Maietti, Samuele Maschio & Thomas Streicher - 2018 - Archive for Mathematical Logic 57 (7-8):873-888.
    Consistency with the formal Church’s thesis, for short CT, and the axiom of choice, for short AC, was one of the requirements asked to be satisfied by the intensional level of a two-level foundation for constructive mathematics as proposed by Maietti and Sambin From sets and types to topology and analysis: practicable foundations for constructive mathematics, Oxford University Press, Oxford, 2005). Here we show that this is the case for the intensional level of the two-level Minimalist Foundation, for short MF, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  55
    Two subcategories of apartness spaces.Hajime Ishihara - 2012 - Annals of Pure and Applied Logic 163 (2):132-139.
  16.  49
    A Note on the Godel-Gentzen Translation.Hajime Ishihara - 2000 - Mathematical Logic Quarterly 46 (1):135-138.
    We give a variant of the Gödel-Gentzen-negative translation, and a syntactic characterization which entails conservativity result for formulas.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  17.  31
    Compactness under constructive scrutiny.Hajime Ishihara & Peter Schuster - 2004 - Mathematical Logic Quarterly 50 (6):540-550.
    How are the various classically equivalent definitions of compactness for metric spaces constructively interrelated? This question is addressed with Bishop-style constructive mathematics as the basic system – that is, the underlying logic is the intuitionistic one enriched with the principle of dependent choices. Besides surveying today's knowledge, the consequences and equivalents of several sequential notions of compactness are investigated. For instance, we establish the perhaps unexpected constructive implication that every sequentially compact separable metric space is totally bounded. As a by-product, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  18.  38
    Quotient topologies in constructive set theory and type theory.Hajime Ishihara & Erik Palmgren - 2006 - Annals of Pure and Applied Logic 141 (1):257-265.
    The standard construction of quotient spaces in topology uses full separation and power sets. We show how to make this construction using only the predicative methods available in constructive type theory and constructive set theory.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  51
    Quasi-apartness and neighbourhood spaces.Hajime Ishihara, Ray Mines, Peter Schuster & Luminiţa Vîţă - 2006 - Annals of Pure and Applied Logic 141 (1):296-306.
    We extend the concept of apartness spaces to the concept of quasi-apartness spaces. We show that there is an adjunction between the category of quasi-apartness spaces and the category of neighbourhood spaces, which indicates that quasi-apartness is a more natural concept than apartness. We also show that there is an adjoint equivalence between the category of apartness spaces and the category of Grayson’s separated spaces.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  20.  78
    Binary Refinement Implies Discrete Exponentiation.Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2006 - Studia Logica 84 (3):361-368.
    Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary refinement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary refinement implies that the class of detachable subsets of a set form a set. Binary refinement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was sufficient to prove that the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  45
    Extended Frames and Separations of Logical Principles.Makoto Fujiwara, Hajime Ishihara, Takako Nemoto, Nobu-Yuki Suzuki & Keita Yokoyama - 2023 - Bulletin of Symbolic Logic 29 (3):311-353.
    We aim at developing a systematic method of separating omniscience principles by constructing Kripke models for intuitionistic predicate logic $\mathbf {IQC}$ and first-order arithmetic $\mathbf {HA}$ from a Kripke model for intuitionistic propositional logic $\mathbf {IPC}$. To this end, we introduce the notion of an extended frame, and show that each IPC-Kripke model generates an extended frame. By using the extended frame generated by an IPC-Kripke model, we give a separation theorem of a schema from a set of schemata in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22. Uniformly convex Banach spaces are reflexive—constructively.Douglas S. Bridges, Hajime Ishihara & Maarten McKubre-Jordens - 2013 - Mathematical Logic Quarterly 59 (4-5):352-356.
    We propose a natural definition of what it means in a constructive context for a Banach space to be reflexive, and then prove a constructive counterpart of the Milman-Pettis theorem that uniformly convex Banach spaces are reflexive.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  46
    Decidable Kripke models of intuitionistic theories.Hajime Ishihara, Bakhadyr Khoussainov & Anil Nerode - 1998 - Annals of Pure and Applied Logic 93 (1-3):115-123.
    In this paper we introduce effectiveness into model theory of intuitionistic logic. The main result shows that any computable theory T of intuitionistic predicate logic has a Kripke model with decidable forcing such that for any sentence φ, φ is forced in the model if and only if φ is intuitionistically deducible from T.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  24.  32
    Non-Deterministic Inductive Definitions and Fullness.Takako Nemoto & Hajime Ishihara - 2016 - In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 163-170.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  32
    Complements of Intersections in Constructive Mathematics.Douglas S. Bridges & Hajime Ishihara - 1994 - Mathematical Logic Quarterly 40 (1):35-43.
    We examine, from a constructive perspective, the relation between the complements of S, T, and S ∩ T in X, where X is either a metric space or a normed linear space. The fundamental question addressed is: If x is distinct from each element of S ∩ T, if s ϵ S, and if t ϵ T, is x distinct from s or from t? Although the classical answer to this question is trivially affirmative, constructive answers involve Markov's principle and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  33
    Relating Bishopʼs function spaces to neighbourhood spaces.Hajime Ishihara - 2013 - Annals of Pure and Applied Logic 164 (4):482-490.
    We extend Bishopʼs concept of function spaces to the concept of pre-function spaces. We show that there is an adjunction between the category of neighbourhood spaces and the category of Φ-closed pre-function spaces. We also show that there is an adjunction between the category of uniform spaces and the category of Ψ-closed pre-function spaces.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  56
    A predicative completion of a uniform space.Josef Berger, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2012 - Annals of Pure and Applied Logic 163 (8):975-980.
  28.  37
    Editorial: Math. Log. Quart. 5/2008.Vasco Brattka, Hajime Ishihara, Matthias Schröder & Ning Zhong - 2008 - Mathematical Logic Quarterly 54 (5):453-453.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  29.  38
    Absolute Continuity and the Uniqueness of the Constructive Functional Calculus.Douglas Bridges & Hajime Ishihara - 1994 - Mathematical Logic Quarterly 40 (4):519-527.
    The constructive functional calculus for a sequence of commuting selfadjoint operators on a separable Hilbert space is shown to be independent of the orthonormal basis used in its construction. The proof requires a constructive criterion for the absolute continuity of two positive measures in terms of test functions.
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  43
    A Definitive Constructive Open Mapping Theorem?Douglas Bridges & Hajime Ishihara - 1998 - Mathematical Logic Quarterly 44 (4):545-552.
    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.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  43
    Separation properties in neighbourhood and quasi-apartness spaces.Robin Havea, Hajime Ishihara & Luminiţa Vîţă - 2008 - Mathematical Logic Quarterly 54 (1):58-64.
    We investigate separation properties for neighbourhood spaces in some details within a framework of constructive mathematics, and define corresponding separation properties for quasi-apartness spaces. We also deal with separation properties for spaces with inequality.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  38
    Equivalents of the finitary non-deterministic inductive definitions.Ayana Hirata, Hajime Ishihara, Tatsuji Kawai & Takako Nemoto - 2019 - Annals of Pure and Applied Logic 170 (10):1256-1272.
    We present statements equivalent to some fragments of the principle of non-deterministic inductive definitions (NID) by van den Berg (2013), working in a weak subsystem of constructive set theory CZF. We show that several statements in constructive topology which were initially proved using NID are equivalent to the elementary and finitary NIDs. We also show that the finitary NID is equivalent to its binary fragment and that the elementary NID is equivalent to a variant of NID based on the notion (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  57
    A continuity principle, a version of Baire's theorem and a boundedness principle.Hajime Ishihara & Peter Schuster - 2008 - Journal of Symbolic Logic 73 (4):1354-1360.
    We deal with a restricted form WC-N' of the weak continuity principle, a version BT' of Baire's theorem, and a boundedness principle BD-N. We show, in the spirit of constructive reverse mathematics, that WC-N'. BT' + ¬LPO and BD-N + ¬LPO are equivalent in a constructive system, where LPO is the limited principle of omniscience.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  34
    Constructive compact operators on a Hilbert space.Hajime Ishihara - 1991 - Annals of Pure and Applied Logic 52 (1-2):31-37.
    In this paper, we deal with compact operators on a Hilbert space, within the framework of Bishop's constructive mathematics. We characterize the compactness of a bounded linear mapping of a Hilbert space into C n , and prove the theorems: Let A and B be compact operators on a Hilbert space H , let C be an operator on H and let α ϵ C . Then α A is compact, A + B is compact, A ∗ is compact, CA (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  43
    On the contrapositive of countable choice.Hajime Ishihara & Peter Schuster - 2011 - Archive for Mathematical Logic 50 (1-2):137-143.
    We show that in elementary analysis (EL) the contrapositive of countable choice is equivalent to double negation elimination for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_{2}^{0}}$$\end{document}-formulas. By also proving a recursive adaptation of this equivalence in Heyting arithmetic (HA), we give an instance of the conservativity of EL over HA with respect to recursive functions and predicates. As a complement, we prove in HA enriched with the (extended) Church thesis that every decidable predicate is recursive.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  36
    On the independence of premiss axiom and rule.Hajime Ishihara & Takako Nemoto - 2020 - Archive for Mathematical Logic 59 (7-8):793-815.
    In this paper, we deal with a relationship among the law of excluded middle, the double negation elimination and the independence of premiss rule ) for intuitionistic predicate logic. After giving a general machinery, we give, as corollaries, several examples of extensions of \ and \ which are closed under \ but do not derive the independence of premiss axiom.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  31
    The uniform boundedness theorem and a boundedness principle.Hajime Ishihara - 2012 - Annals of Pure and Applied Logic 163 (8):1057-1061.