Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(formal arithmetic). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universiteit Utrecht

1. Joosten, Joost Johannes. Interpretability formalized.

Degree: 2004, Universiteit Utrecht

 The dissertation is in the first place a treatment of mathematical interpretations. Interpretations themselves will be studied, but also shall they be used to study… (more)

Subjects/Keywords: Wijsbegeerte; provability logics; interpretability; formal arithmetic; Primitive Recursive Arithmetic; PRA; Modal Semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Joosten, J. J. (2004). Interpretability formalized. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/1275

Chicago Manual of Style (16th Edition):

Joosten, Joost Johannes. “Interpretability formalized.” 2004. Doctoral Dissertation, Universiteit Utrecht. Accessed June 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/1275.

MLA Handbook (7th Edition):

Joosten, Joost Johannes. “Interpretability formalized.” 2004. Web. 19 Jun 2019.

Vancouver:

Joosten JJ. Interpretability formalized. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2004. [cited 2019 Jun 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/1275.

Council of Science Editors:

Joosten JJ. Interpretability formalized. [Doctoral Dissertation]. Universiteit Utrecht; 2004. Available from: http://dspace.library.uu.nl:8080/handle/1874/1275

2. Garrett, Atlee Margaret. Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic.

Degree: 1942, North Texas State Teachers College

 The problem in this investigation has a three-fold purpose: namely, (1) to determine the results of delaying formal arithmetic until the fourth grade; (2) to… (more)

Subjects/Keywords: formal method; informal method; arithmetic; teaching; Arithmetic  – Study and teaching (Elementary)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Garrett, A. M. (1942). Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic. (Thesis). North Texas State Teachers College. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc70341/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Garrett, Atlee Margaret. “Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic.” 1942. Thesis, North Texas State Teachers College. Accessed June 19, 2019. https://digital.library.unt.edu/ark:/67531/metadc70341/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Garrett, Atlee Margaret. “Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic.” 1942. Web. 19 Jun 2019.

Vancouver:

Garrett AM. Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic. [Internet] [Thesis]. North Texas State Teachers College; 1942. [cited 2019 Jun 19]. Available from: https://digital.library.unt.edu/ark:/67531/metadc70341/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Garrett AM. Evaluation of the Formal Versus the Informal Method of Teaching Arithmetic. [Thesis]. North Texas State Teachers College; 1942. Available from: https://digital.library.unt.edu/ark:/67531/metadc70341/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Joosten, Joost Johannes. Interpretability formalized.

Degree: 2004, University Utrecht

 The dissertation is in the first place a treatment of mathematical interpretations. Interpretations themselves will be studied, but also shall they be used to study… (more)

Subjects/Keywords: provability logics; interpretability; formal arithmetic; Primitive Recursive Arithmetic; PRA; Modal Semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Joosten, J. J. (2004). Interpretability formalized. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/1275 ; URN:NBN:NL:UI:10-1874-1275 ; urn:isbn:90-393-3869-8 ; URN:NBN:NL:UI:10-1874-1275 ; http://dspace.library.uu.nl/handle/1874/1275

Chicago Manual of Style (16th Edition):

Joosten, Joost Johannes. “Interpretability formalized.” 2004. Doctoral Dissertation, University Utrecht. Accessed June 19, 2019. http://dspace.library.uu.nl/handle/1874/1275 ; URN:NBN:NL:UI:10-1874-1275 ; urn:isbn:90-393-3869-8 ; URN:NBN:NL:UI:10-1874-1275 ; http://dspace.library.uu.nl/handle/1874/1275.

MLA Handbook (7th Edition):

Joosten, Joost Johannes. “Interpretability formalized.” 2004. Web. 19 Jun 2019.

Vancouver:

Joosten JJ. Interpretability formalized. [Internet] [Doctoral dissertation]. University Utrecht; 2004. [cited 2019 Jun 19]. Available from: http://dspace.library.uu.nl/handle/1874/1275 ; URN:NBN:NL:UI:10-1874-1275 ; urn:isbn:90-393-3869-8 ; URN:NBN:NL:UI:10-1874-1275 ; http://dspace.library.uu.nl/handle/1874/1275.

Council of Science Editors:

Joosten JJ. Interpretability formalized. [Doctoral Dissertation]. University Utrecht; 2004. Available from: http://dspace.library.uu.nl/handle/1874/1275 ; URN:NBN:NL:UI:10-1874-1275 ; urn:isbn:90-393-3869-8 ; URN:NBN:NL:UI:10-1874-1275 ; http://dspace.library.uu.nl/handle/1874/1275

4. Vicente, Luciano. Uma prova de incompletude da aritmética baseada no teorema das definições recursivas.

Degree: Mestrado, Filosofia, 2008, University of São Paulo

Esta dissertação estabelece a incompletude de um sistema formal cujas únicas constantes não-lógicas são 0 e s (respectivamente, o número natural 0 e a função… (more)

Subjects/Keywords: Arithmetic; Aritmética formal; Definições recursivas; Definition by recursion; Incompleteness; Incompletude; Logic; Lógica; Teoria dos Tipos; Type theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vicente, L. (2008). Uma prova de incompletude da aritmética baseada no teorema das definições recursivas. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/8/8133/tde-08102008-173642/ ;

Chicago Manual of Style (16th Edition):

Vicente, Luciano. “Uma prova de incompletude da aritmética baseada no teorema das definições recursivas.” 2008. Masters Thesis, University of São Paulo. Accessed June 19, 2019. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-08102008-173642/ ;.

MLA Handbook (7th Edition):

Vicente, Luciano. “Uma prova de incompletude da aritmética baseada no teorema das definições recursivas.” 2008. Web. 19 Jun 2019.

Vancouver:

Vicente L. Uma prova de incompletude da aritmética baseada no teorema das definições recursivas. [Internet] [Masters thesis]. University of São Paulo; 2008. [cited 2019 Jun 19]. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-08102008-173642/ ;.

Council of Science Editors:

Vicente L. Uma prova de incompletude da aritmética baseada no teorema das definições recursivas. [Masters Thesis]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/8/8133/tde-08102008-173642/ ;


Brno University of Technology

5. Lupták, Filip. Systémy převodníků a jejich aplikace .

Degree: 2017, Brno University of Technology

 Táto práca zavádza nový formálny model „systém prevodníkov." Systém prevodníkov sa skladá z niekoľkých konečných prevodníkov, ktoré spolupracujú. Práca skúma vyjadrovaciu silu tohto formálneho modelu… (more)

Subjects/Keywords: Konečný prevodník; Systém prevodníkov; Syntaxou riadený preklad; Aritmetické výrazy; Postfixová notácia; Formálne jazyky; Finite transducer; Transducer system; Syntax directed translation; Arithmetic expressions; Postfix notation; Formal languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lupták, F. (2017). Systémy převodníků a jejich aplikace . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69660

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lupták, Filip. “Systémy převodníků a jejich aplikace .” 2017. Thesis, Brno University of Technology. Accessed June 19, 2019. http://hdl.handle.net/11012/69660.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lupták, Filip. “Systémy převodníků a jejich aplikace .” 2017. Web. 19 Jun 2019.

Vancouver:

Lupták F. Systémy převodníků a jejich aplikace . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/11012/69660.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lupták F. Systémy převodníků a jejich aplikace . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/69660

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Florida

6. Seyfarth, Benjamin R., 1953-. On the use of continuation languages in lookahead LR parsing.

Degree: 1989, University of Florida

Subjects/Keywords: Algorithms; Arithmetic; Context free grammars; Equivalence relation; Grammar; Homomorphisms; Mathematical sequences; Pagers; Symbolism; Vertices; Formal languages; Generative grammar; Parsing (Computer grammar)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Seyfarth, Benjamin R., 1. (1989). On the use of continuation languages in lookahead LR parsing. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00031414

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Seyfarth, Benjamin R., 1953-. “On the use of continuation languages in lookahead LR parsing.” 1989. Thesis, University of Florida. Accessed June 19, 2019. http://ufdc.ufl.edu/AA00031414.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Seyfarth, Benjamin R., 1953-. “On the use of continuation languages in lookahead LR parsing.” 1989. Web. 19 Jun 2019.

Vancouver:

Seyfarth, Benjamin R. 1. On the use of continuation languages in lookahead LR parsing. [Internet] [Thesis]. University of Florida; 1989. [cited 2019 Jun 19]. Available from: http://ufdc.ufl.edu/AA00031414.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seyfarth, Benjamin R. 1. On the use of continuation languages in lookahead LR parsing. [Thesis]. University of Florida; 1989. Available from: http://ufdc.ufl.edu/AA00031414

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

7. Raiskup, Pavel. Vylepšení analýzy živých proměnných pomocí points-to analýzy .

Degree: 2012, Brno University of Technology

 Jazyky, jako je C, hojně využívají práce s ukazateli. Implemetace dynamických datových struktur vázaných ukazateli a operací nad nimi však není jednoduchá - významně zvyšuje… (more)

Subjects/Keywords: Statická analýza; analýza živých proměnných; analýza ukazatelů; points-to analýza; analýza aliasů; ukazatelová aritmetika; Code Listener; gcc zásuvný modul; formální verifikace; Static analysis; live variable analysis; pointer analysis; points-to analysis; alias analysis; pointer arithmetic; Code Listener; gcc plugin; formal verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raiskup, P. (2012). Vylepšení analýzy živých proměnných pomocí points-to analýzy . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53654

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Raiskup, Pavel. “Vylepšení analýzy živých proměnných pomocí points-to analýzy .” 2012. Thesis, Brno University of Technology. Accessed June 19, 2019. http://hdl.handle.net/11012/53654.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Raiskup, Pavel. “Vylepšení analýzy živých proměnných pomocí points-to analýzy .” 2012. Web. 19 Jun 2019.

Vancouver:

Raiskup P. Vylepšení analýzy živých proměnných pomocí points-to analýzy . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/11012/53654.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raiskup P. Vylepšení analýzy živých proměnných pomocí points-to analýzy . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/53654

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Martin-Dorel, Erik. Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms.

Degree: Docteur es, Informatique, 2012, Lyon, École normale supérieure

L'implantation en Virgule Flottante (VF) d'une fonction à valeurs réelles est réalisée avec arrondi correct si le résultat calculé est toujours égal à l'arrondi de… (more)

Subjects/Keywords: Arithmétique à virgule flottante; Standard IEEE 754; Arrondi correct; Dilemme du fabricant de tables; Algorithme SLZ; Technique de Coppersmith; Preuves formelles Coq; SSReflect; Lemme de Hensel; Certificats; Racines entières; Approximation polynomiale rigoureuse; Modèles de Taylor; Arithmétique par intervalles; Reste de Taylor-Lagrange; Fonctions D-finies; Racine carrée; Norme 2D; Midpoints; TwoMultFMA; Fast2Sum; TwoSum; Double-arrondi; Bibliothèque Flocq; Floating-point arithmetic; IEEE 754 standard; Correct rounding; Table Maker's Dilemma; SLZ algorithm; Coppersmith's technique; Coq formal proofs; SSReflect; Hensel's lemma; Certificates; Integral roots; Rigorous polynomial approximation; Taylor models; Interval arithmetic; Taylor-Lagrange remainder; D-finite functions; Square root; 2D norms; Midpoints; TwoMultFMA; Fast2Sum; TwoSum; Double-rounding; Flocq library

…we thus focus on the formal verification of results related to floating-point arithmetic… …Introduction Floating-point arithmetic is by far the most frequently used way to deal with real… …rounding error bounded by a given threshold would lead to quite a weakly-specified arithmetic. In… …IEEE 754 standard for floating-point arithmetic, published in √ 1985, requires that the five… …arithmetic, where the number of cases to test is at most 232 . In order to address the TMD for… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Martin-Dorel, E. (2012). Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2012ENSL0742

Chicago Manual of Style (16th Edition):

Martin-Dorel, Erik. “Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms.” 2012. Doctoral Dissertation, Lyon, École normale supérieure. Accessed June 19, 2019. http://www.theses.fr/2012ENSL0742.

MLA Handbook (7th Edition):

Martin-Dorel, Erik. “Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms.” 2012. Web. 19 Jun 2019.

Vancouver:

Martin-Dorel E. Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2012. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2012ENSL0742.

Council of Science Editors:

Martin-Dorel E. Contributions à la vérification formelle d'algorithmes arithmétiques : Contributions to the Formal Verification of Arithmetic Algorithms. [Doctoral Dissertation]. Lyon, École normale supérieure; 2012. Available from: http://www.theses.fr/2012ENSL0742

.