Deciding Predicate Logical Theories of Real-Valued Functions
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918002651299840 |
|---|---|
| author | Ratschan, Stefan |
| author_facet | Ratschan, Stefan |
| contents | The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_16505 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Deciding Predicate Logical Theories of Real-Valued Functions Ratschan, Stefan Logic in Computer Science The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible. |
| title | Deciding Predicate Logical Theories of Real-Valued Functions |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2306.16505 |