Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Predicate Functor Logic
CHF 48.85
Auf Lager
SKU
UUFARI6K42K
1 Verfügbar 
Geliefert zwischen Mi., 04.02.2026 und Do., 05.02.2026
Details
High Quality Content by WIKIPEDIA articles! In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic devices called predicate functors (or predicate modifiers) that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine. Quine proposed PFL as a way of algebraizing first-order logic in a manner analogous to how Boolean algebra algebraizes propositional logic. He designed PFL to have exactly the expressive power of first-order logic with identity. Hence the metamathematics of PFL are exactly those of first-order logic with no interpreted predicate letters: both logics are sound, complete, and undecidable. Most work Quine published on logic and mathematics in the last 30 year of his life touched on PFL in some way.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130339197
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T6mm
- Jahr 2010
- EAN 9786130339197
- Format Kartonierter Einband
- ISBN 978-613-0-33919-7
- Titel Predicate Functor Logic
- Untertitel Mathematical Logic, First-order Logic, Predicate Logic, Quantification, Willard Van Orman Quine, Cylindric Algebra, Relation Algebra, Higher-order Function, Functional Completeness
- Gewicht 171g
- Herausgeber Betascript Publishers
- Anzahl Seiten 104
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
