Spelling suggestions: "subject:"intuitionistic mathematics"" "subject:"intuitionnistic mathematics""
1 |
Intuitionistische axiomatiek der projectieve meetkundeHeyting, A. January 1925 (has links)
Thesis--Universiteit van Amsterdam. / "Litteratuur" : p. [93]-94.
|
2 |
On the justification of mathematical intuitionismMarquis, Jean-Pierre January 1985 (has links)
No description available.
|
3 |
Die hoofstelling van die algebra van intuïsionistiese standpuntLoor, Barend de. January 1900 (has links)
Thesis--Amsterdam, 1925.
|
4 |
Investigations on the intuitionistic propositional calculusJongh, Dick de. January 1968 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1968. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliography.
|
5 |
Semantic studies of intuitionistic logicCriscuolo, Giovanni January 1972 (has links)
This thesis is a study of intuitionistic semantics as presented by Beth [2] and Kripke [12], using the usual methods of investigation
of classical informal logic.
Beth models and Kripke models are presented in a manner which does not depend upon a prior definition of the notion of degree of a formula.
It is shown that both classes of intuitionistic models are a generalization
of the concept of classical models, i.e. they contain classical models as particular case, and that " branching " is a necessary condition in order that intuitionistic logic be complete with respect to them.
Intuitionistic sentential calculus is complete with respect to the strong Beth model, the intersection of Beth models and Kripke models.
But, if by analogy with the classical case, we extend them to first order logic we find that they are not adequate because, for example, the sentence [formula omitted]x(B(x) V C) [formula omitted] ([formula omitted]xB(x) V C), where C does not contain x free, is valid in these models but not intuitionistically provable.
This observation helps to explain the formal differences between the two classes of models. The simplified Kripke models and the simplified Beth models are then introduced and their equivalence with the Kripke models and the Beth models, respectively, is proved.
The first ones allow a better notation and a better understanding of the relation R occurring in the definition of Kripke models. The second ones have the important property that, if the domain is finite, any classically valid sentence is valid in them. Finally a semantic proof of most of the reduction theorems from classical to intuitionistic logic is given. / Science, Faculty of / Computer Science, Department of / Graduate
|
6 |
On the justification of mathematical intuitionismMarquis, Jean-Pierre January 1985 (has links)
No description available.
|
7 |
Some results concerning intuitionistic logical categoriesTennenhouse, Karen Heather. January 1975 (has links)
No description available.
|
8 |
Some results concerning intuitionistic logical categoriesTennenhouse, Karen Heather. January 1975 (has links)
No description available.
|
9 |
Three mathematical problems in logicAczel, P. H. G. January 1966 (has links)
No description available.
|
10 |
Undecidability of intuitionistic theoriesBrierley, William. January 1985 (has links)
No description available.
|
Page generated in 0.117 seconds