Computability in Europe 2008
Logic and Theory of Algorithms
|Author(s):||Matthias Baaz and George Metcalfe|
|Slot:||Tue, 12:00-12:20, Room 22 (col. 4)|
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.
|websites: Arnold Beckmann||2008-05-19|