When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Conservative extension - Wikipedia

    en.wikipedia.org/wiki/Conservative_extension

    Each model-theoretic conservative extension also is a (proof-theoretic) conservative extension in the above sense. [3] The model theoretic notion has the advantage over the proof theoretic one that it does not depend so much on the language at hand; on the other hand, it is usually harder to establish model theoretic conservativity.

  3. Extension by new constant and function names - Wikipedia

    en.wikipedia.org/wiki/Extension_by_new_constant...

    In mathematical logic, a theory can be extended with new constants or function names under certain conditions with assurance that the extension will introduce no contradiction. Extension by definitions is perhaps the best-known approach, but it requires unique existence of an object with the desired property. Addition of new names can also be ...

  4. Model theory - Wikipedia

    en.wikipedia.org/wiki/Model_theory

    In mathematical logic, model theory is the study ... types over the empty set. Then there is a model ... holds then every model has a saturated elementary extension ...

  5. Axiom of extensionality - Wikipedia

    en.wikipedia.org/wiki/Axiom_of_extensionality

    Alternatively, in untyped logic, we can require to be false whenever is an ur-element. In this case, the usual axiom of extensionality would then imply that every ur-element is equal to the empty set. To avoid this consequence, we can modify the axiom of extensionality to apply only to nonempty sets, so that it reads:

  6. Extension by definitions - Wikipedia

    en.wikipedia.org/wiki/Extension_by_definitions

    In mathematical logic, more specifically in the proof theory of first-order theories, extensions by definitions formalize the introduction of new symbols by means of a definition. For example, it is common in naive set theory to introduce a symbol ∅ {\displaystyle \emptyset } for the set that has no member.

  7. Type (model theory) - Wikipedia

    en.wikipedia.org/wiki/Type_(model_theory)

    In model theory and related areas of mathematics, a type is an object that describes how a (real or possible) element or finite collection of elements in a mathematical structure might behave. More precisely, it is a set of first-order formulas in a language L with free variables x 1 , x 2 ,..., x n that are true of a set of n -tuples of an L ...

  8. Philosophical logic - Wikipedia

    en.wikipedia.org/wiki/Philosophical_logic

    On this view, classical predicate logic introduces predicates with an empty extension while free logic introduces singular terms of non-existing things. [51] An important problem for free logic consists in how to determine the truth value of expressions containing empty singular terms, i.e. of formulating a formal semantics for free logic. [56]

  9. Substructure (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Substructure_(mathematics)

    Shifting the point of view, the larger structure is called an extension or a superstructure of its substructure. In model theory , the term " submodel " is often used as a synonym for substructure, especially when the context suggests a theory of which both structures are models.