Premium
EIN NEUER BEWEIS UND EINE VERSCHÄRFUNG FÜR DEN REDUKTIONSTYP ∀∃∀∞(0, 1) MIT EINER ANWENDUNG AUF DIE SPEKTRALE DARSTELLUNG VON PRÄDIKATEN
Author(s) -
Deutsch Michael,
Deutsch M.
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380153
Subject(s) - mathematics , satisfiability , predicate (mathematical logic) , combinatorics , discrete mathematics , computer science , programming language
A simultaneous semantical and syntactical reduction is given for the satisfiability respectively finite satisfiability of first order formulas. We choose ∀∃∀∞(0, 1) as conservative reduction class and allow only formulas out of ∀∃∀∞(0, 1) having a simple set theoretical model if they are satisfiable at all. With the same method we get a spectral representation of any ϱ‐ary enumerable respectively coenumerable predicate by a formula out of ∀∃∀∞(ϱ, 1).