Admissible Models

=======================

Definition

An Admissible Model is a Formal System of mathematics that is Complete, Consistent, and Satisfiable. In other words, it is a logical framework that allows us to express all statements about the world that we believe are true, with absolute certainty.

History

The concept of admissible Models dates back to the early days of logic and philosophy, where mathematicians such as Georg Cantor and Ernst Zermelo developed systems of Set Theory that were designed to be Consistent and Complete. However, it wasn’t until the development of Second-Order Logic in the mid-20th century that the term “Admissible Model” gained widespread use.

Properties

A Formal System is admissible if it satisfies the following properties:

1. Completeness: The system must be able to express all true statements about the world.
2. Consistency: The system must not contain any contradictions or self-referential paradoxes.
3. Satisfiability: The system must allow us to determine whether a given statement is true.

Examples

Example 1: First-Order Logic

First-Order Logic is a simple Formal System that consists of atomic statements, logical operators, and quantifiers. It is admissible because it satisfies the following properties:

• Completeness: First-Order Logic can express all true statements about the world.
• Consistency: First-Order Logic does not contain any contradictions or self-referential paradoxes.
• Satisfiability: First-Order Logic allows us to determine whether a given statement is true.

Example 2: Second-Order Logic

Second-Order Logic extends First-Order Logic by allowing us to speak about sets and functions. It is admissible because it satisfies the following properties:

• Completeness: Second-Order Logic can express all true statements about the world.
• Consistency: Second-Order Logic does not contain any contradictions or self-referential paradoxes.
• Satisfiability: Second-Order Logic allows us to determine whether a given statement is true.

Applications

Admissible Models have numerous applications in mathematics, computer science, and philosophy. Some examples include:

Mathematics

• Set Theory: Admissible Models are used to construct sets and functions that satisfy certain properties.
• Model theory: Admissible Models are used to study the behavior of mathematical structures under different interpretations.

Computer Science

• Formal verification: Admissible Models are used in formal verification techniques such as model checking and property proof.
• Compilers: Admissible Models are used in compiler design to ensure that code is compiled correctly.

Philosophy

• Modal Logic: Admissible Models are used to study the Modal Logic of possibility, necessity, and obligation.
• Propositional and Predicate Logic: Admissible Models are used to formalize logical formulas and prove their validity.

Notation

The notation for admissible Models typically consists of:

• Model Theory Framework: A set of axioms that define the properties of a model (e.g. ZFC or S5).
• Models: Instances of the Model Theory Framework that satisfy certain conditions (e.g. a model of ZFC is a Complete and Consistent structure).

Criticisms

Despite its importance, admissible Models have several criticisms:

Lack of Completeness for large Models

Admissible Models can be incomplete for very large structures, which means that some true statements may not be expressible in the Formal System.

Difficulty in dealing with complex Models

Dealing with complex Models, such as those involving multiple levels of sets or functions, can be extremely challenging.

Conclusion

In conclusion, admissible Models are a fundamental concept in mathematics and computer science. They provide a way to formally represent and reason about mathematical structures, and have numerous applications in various fields. However, they also come with limitations, particularly when dealing with complex Models or large structures.

External Links

• Model theory: A comprehensive online resource for model theory.
• Set Theory: A brief overview of Set Theory and its connections to admissible Models.
• Computer science: A collection of resources on formal verification techniques and compiler design.