Gödel logic

In mathematical logic, a first-order Gödel logic is a member of a family of finite- or infinite-valued logics in which the sets of truth values V are closed subsets of the interval [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics. The concept is named after Kurt Gödel. ^[1]

References

↑ First-order Gödel logics Authors: Matthias Baaz, Norbert Preining, Richard Zach.

Set theory

Axioms	Choice countable dependent Constructibility (V=L) Determinacy Extensionality Infinity Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification

Operations	Cartesian product Complement De Morgan's laws Disjoint union Intersection Power set Set difference Symmetric difference Union

Concepts Methods	Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Transfinite induction Venn diagram

Set types	Countable Empty Finite (hereditarily) Fuzzy Infinite Recursive Subset · Superset Transitive Uncountable Universal

Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck

Paradoxes Problems	Russell's paradox Suslin's problem

Set theorists	Abraham Fraenkel Bertrand Russell Ernst Zermelo Georg Cantor John von Neumann Kurt Gödel Paul Bernays Paul Cohen Richard Dedekind Thomas Jech Thoralf Skolem Willard Quine

Logic

Fields

Foundations

Lists

topics	Mathematical logic Boolean algebra Set theory

other	Logicians Rules of inference Paradoxes Fallacies Logic symbols

Portal
Category
WikiProject (talk)
changes

This article is issued from Wikipedia - version of the 7/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.