FlashKeepers

Advanced Math · College · College and University

Mathematical Logic and Set Theory

First-order logic, ZFC axioms, ordinals, cardinality, the axiom of choice, completeness and Godel theorems.

About this set

34 basic cards for College Advanced Math. It opens with "What is a first-order language?" and "What is a formula in first-order logic?". Study it alongside the other College sets below.

34 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What is a first-order language?
Show answerA collection of logical symbols (variables, connectives, quantifiers) and non-logical symbols (predicates, functions, constants).
What is a formula in first-order logic?
Show answerA finite sequence of symbols from the language's alphabet that follows the rules of syntax for well-formed expressions.
What does it mean for a formula to be satisfiable?
Show answerThere exists a model and an interpretation of variables under which the formula evaluates to true.
Define a model in first-order logic.
Show answerA structure assigning meaning to the language's symbols: a domain of objects and interpretations of predicates and functions over that domain.
What is the difference between satisfiability and validity in first-order logic?
Show answerA formula is satisfiable if true in some model, and valid if true in every model.
State the Soundness Theorem for first-order logic.
Show answerIf a formula can be proven from axioms using valid inference rules, then it is valid (true in all models).
What does logical consequence mean?
Show answerFormula B is a logical consequence of set A if B is true in every model where all formulas in A are true.
State the Axiom of Extensionality.
Show answerTwo sets are equal if and only if they have exactly the same elements.
State the Axiom of Foundation.
Show answerEvery nonempty set contains an element with which it has no common elements (no infinite descending membership chains).
State the Axiom of Pairing.
Show answerFor any two sets x and y, there exists a set containing exactly x and y as its elements.
State the Axiom of Union.
Show answerFor any set S, there exists a set U containing all elements of all sets in S.
State the Axiom of Power Set.
Show answerFor any set S, there exists a set P whose elements are exactly the subsets of S.
State the Axiom of Infinity.
Show answerThere exists a set that contains the empty set and is closed under the operation of taking successors.
State the Axiom of Replacement.
Show answerIf a property P(x, y) associates each x in set A with a unique y, then there is a set B containing all such y.
State the Axiom of Separation.
Show answerFor any set S and property P(x), there exists a set T whose elements are exactly those elements of S for which P(x) is true.

19 more cards in the app

Study this set free