- Alternative title
-
Beweisen von Theoremen in höherstufiger Logik mit SMT-Lösern
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Technische Universität München, Diss., 2012
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
Universitätsbibliothek der TU München
- (when)
-
2012
- Creator
-
Böhme, Sascha
- Contributor
- URN
-
urn:nbn:de:bvb:91-diss-20120511-1084525-1-4
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Böhme, Sascha
- Nipkow, Tobias
- Rybalchenko, Andrey
- Universitätsbibliothek der TU München
Time of origin
- 2012
Other Objects (12)
Proving theorems of higher-order logic with SMT solvers
Formal analysis of 2D image processing filters using higher-order logic theorem proving
Automated theorem proving for dependent typed theories via a translation to higher-order logic
Proving Linearizability with Temporal Logic
Proving termination of probabilistic recursive programs via SMT-solving
Equality and extensionality in automated higher-order theorem proving
Higher-Order Automated Theorem Proving for Natural Language Semantics
Equality and extensionality in automated higher-order theorem proving
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic
Higher-order constraint logic programming
Proving theorems of higher-order logic with SMT solvers
Formal analysis of 2D image processing filters using higher-order logic theorem proving
Automated theorem proving for dependent typed theories via a translation to higher-order logic
Proving Linearizability with Temporal Logic
Proving termination of probabilistic recursive programs via SMT-solving
Equality and extensionality in automated higher-order theorem proving
Higher-Order Automated Theorem Proving for Natural Language Semantics
Equality and extensionality in automated higher-order theorem proving
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic
Higher-order constraint logic programming
Proving theorems of higher-order logic with SMT solvers
Formal analysis of 2D image processing filters using higher-order logic theorem proving
Automated theorem proving for dependent typed theories via a translation to higher-order logic
Proving Linearizability with Temporal Logic
Proving termination of probabilistic recursive programs via SMT-solving
Equality and extensionality in automated higher-order theorem proving
Higher-Order Automated Theorem Proving for Natural Language Semantics
Equality and extensionality in automated higher-order theorem proving
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic