Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"constructive mathematics"”.
-
Constructive mathematics - its set theory and practice
… is laid down a set-theoretic foundation for constructive mathematics as understood by Errett Bishop and his followers. The work of this part closely follows the lines of the corresponding classical development of set theory by Anthony Morse, highlights several classical definitions and …
-
Constructive Mathematics and Standards of Proof: Historical and Philosophical Perspectives
… of three individual papers on the philosophy of mathematics. The first two papers, which are Chapters 2 and 3 of the dissertation, focus on the history and philosophy of constructive mathematics. Chapter 2 presents a unified reading of constructivist philosophy from Kant to 1960s while also …
-
Finiteness in cubical type theory
… thesis will explore and explain finiteness in constructive mathematics: using this setting, it will also serve as an introduction to constructive mathematics in Cubical Agda, and some related topics.
-
Constructive Analysis of Partial Differential Equations
… of the Dirichlet Problem within Errett Bishop's constructive mathematics. It roughly falls into three major parts: a critical analysis of the classical approaches from a constructive point of view (Chapter 2); constructive results on the existence, stability, and maximality of weak solutions …
-
Constructing fixed points and economic equilibria
Constructive mathematics is mathematics with intuitionistic logic (together with some appropriate, predicative, foundation)-it is often crudely characterised as mathematics without the law of excluded middle. The intuitionistic interpretation of the connectives and quantifiers ensure that …
-
Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability
… of proof theory - more precisely, in reverse mathematics and constructive mathematics. Reversed mathematics, proposed by Harvey Friedman, aims to classify the strength of mathematical theorems by identifying the required axioms. In this framework, we focus on two classical results relative to …
-
Kontinuum und Konstitution der Wirklichkeit
… are compared with models of todays logic and mathematics. There is considerd constructive mathematics, the logic of perception from Bell, Blau's Logic of reflection and a model of Myrvold. Then there is developed a new model.
-
Continuations and Martin-Löf's type theory : a thesis presented in partial fulfilment of the requirements of the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand
M-LTT is a theory designed to formalize constructive mathematics. By appealing to the Curry-Howard 'propositions as types' analogy, and to the Brouwer-Heyting-Kolmogorov interpretation of intuitionistic logic we can treat M-LTT as a framework for the specification and derivation of correct …
-
Formal methods in the theories of rings and domains
… has been resumed within the framework of constructive mathematics. This undertaking has already shown its feasability for a considerable part of commutative algebra. In particular, point-free methods have been playing a primary role, emerging as the appropriate language for expressing the …
-
Program extraction from coinductive proofs and its application to exact real arithmetic
… extraction has been initiated in the field of constructive mathematics, and it attracts interest not only from mathematicians but also from computer scientists nowadays. From a mathematical viewpoint its aim is to figure out computational meaning of proofs, while from a computer-scientific …
-
Constructivity and Predicativity: Philosophical Foundations
… within foundational systems for Bishop constructive mathematics: intuitionistic logic and predicativity. The latter, in particular, is the main focus of the thesis. The use of intuitionistic logic affects the notion of proof : constructive proofs may be seen as very general algorithms. …
-
Computability and Structure
This dissertation contains results in the area of constructive mathematics with emphasis to computable algebra and computable analysis. Mal'cev [66] and Rabin [86] initiated the study of computable groups, and Turing [96, 95] started the investigation of effective procedures in analysis. The thesis …
-
Constructive infinitary game theory
… In this paper, we will present several constructive results. It is our goal to lay some of the foundation for future work in Constructive Infinitary Game Theory. In particular, we hope our work will lead to the construction of the winning strategy for open sets.
-
Constructive topology of bishop spaces
… (TBS) is so far the least developed approach to constructive topology with points. Bishop introduced function spaces, here called Bishop spaces, in 1967, without really exploring them, and in 2012 Bridges revived the subject. In this Thesis we develop TBS. Instead of having a common …
-
Semantic and Mathematical Foundations for Intuitionism
… the proper foundation for the intuitionistic mathematics whose development began with L.E.J. Brouwer's work in the first half of the 20th Century. It is taken for granted by most philosophers, logicians, and mathematicians interested in foundational questions that intuitionistic mathematics …
-
Free Groups in Homotopy Type Theory - Free Groups as Filtered Colimits
… this is not so. This is the case in univalent mathematics, where not every set a priori has this property. Existing work uses the Church-Rosser property to get around this, while we propose a different appraoch. First, the free group is constructed for finite sets in the expected manner. This …
-
Fundamentação computacional da matemática intervalar
A Matemática Intervalar se assenta em dois conceitos fundamentais, a propriedade da inclusão-monotonicidade de sua aritmética e uma topologia de Hausdorff definida no conjunto dos intervalos. A propriedade da inclusão-monotonicidade tem se revelado uma ferramenta útil na elaboração de algoritmos …
-
Algorithms for Analytic Combinatorics: Positivity Bounds and D-finite Operators
… many initial sequence terms. We provide fully constructive versions of ACSV arguments in the simplest case, then use these to derive an index N so that positivity of our asymptotic implies positivity of our diagonal for all larger index values, under some small additional assumptions about the …