TU Darmstadt / ULB / TUbiblio

Items in division

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Date | Item Type | Language | No Grouping
Jump to: B | C | G | K | S | Z
Number of items at this level: 15.

B

Blumensath, Achim and Wolf, Felix
Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald (eds.) :

Bisimulation Invariant Monadic-Second Order Logic in the Finite.
[Online-Edition: http://drops.dagstuhl.de/opus/volltexte/2018/9121]
In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Dagstuhl, Germany. In: Leibniz International Proceedings in Informatics (LIPIcs) , 107 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany
[Conference or Workshop Item] , (2018)

Briseid, Eyvind Martol :
On Rates of Convergence in Metric Fixed Point Theory.
[Online-Edition: urn:nbn:de:tuda-tuprints-19663]
Technische Universität , Darmstadt
[Ph.D. Thesis], (2009)

C

Canavoi, Felix :
Cayley Structures and the Expressiveness of Common Knowledge Logic.
[Online-Edition: https://tuprints.ulb.tu-darmstadt.de/8269]
Technische Universität , Darmstadt
[Ph.D. Thesis], (2018)

G

Gregoriades, Vassilios :
Descriptive set theory: advancements in effective theory and applications.
TU Darmstadt , Darmstadt
[Habilitation] , (2016)

Gaspar, Jaime :
Proof interpretations: theoretical and practical aspects.
[Online-Edition: urn:nbn:de:tuda-tuprints-28518]
Technische Universität Darmstadt
[Ph.D. Thesis], (2011)

K

Koutsoukou-Argyraki, Angeliki :
Proof Mining for Nonlinear Operator Theory: Four Case Studies on Accretive Operators, the Cauchy Problem and Nonexpansive Semigroups.
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/6101]
Technische Universität Darmstadt , Darmstadt
[Ph.D. Thesis], (2016)

Körnlein, Daniel :
Quantitative Analysis of Iterative Algorithms in Fixed Point Theory and Convex Optimization.
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/5485]
Technische Universität Darmstadt , Darmstadt
[Ph.D. Thesis], (2016)

Kreuzer, Alexander P. :
Proof mining and combinatorics : Program extraction for Ramsey's theorem for pairs.
[Online-Edition: urn:nbn:de:tuda-tuprints-29720]
TU Darmstadt
[Ph.D. Thesis], (2012)

Kartzow, Alexander :
First-Order Model Checking on Generalisations of Pushdown Graphs.
[Online-Edition: urn:nbn:de:tuda-tuprints-26815]
TU Darmstadt Fachbereich Mathematik
[Ph.D. Thesis], (2011)

S

Steinberg, Florian :
Computational Complexity Theory for Advanced Function Spaces in Analysis.
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/6096]
Technische Universität , Darmstadt
[Ph.D. Thesis], (2016)

Z

Zahn, Peter :
Erblich endliche Mengen und die Widerspruchsfreiheit einer abgeschwächten Version von ZFC (Erweiterte Fassung).
[Online-Edition: https://tuprints.ulb.tu-darmstadt.de/8463]

[Report] , (2019)

Zahn, Peter :
Erblich endliche Mengen und die Widerspruchsfreiheit einer abgeschwächten Version von ZFC.
[Online-Edition: https://tuprints.ulb.tu-darmstadt.de/8259]

[Report] , (2018)

Zahn, Peter :
Eignet sich "unbestimmt" als Wahrheitswert?
[Online-Edition: https://tuprints.ulb.tu-darmstadt.de/7744]

[Report] , (2018)

Zahn, Peter :
Interpretation unscharfer Aussagen bzw. Relationen als Einermengen bzw. Funktionen.
[Online-Edition: https://tuprints.ulb.tu-darmstadt.de/8109]

[Report] , (2018)

Zahn, Peter :
Assertion Games to Justify Classical Reasoning.
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/7545]
In: Synthese (148) pp. 309-343.
[Article] , (2006)

This list was generated on Sun Apr 21 01:27:04 2019 CEST.