# Category:Formal Semantics

This category contains results about Formal Semantics.

Definitions specific to this category can be found in Definitions/Formal Semantics.

A **formal semantics** for $\mathcal L$ comprises:

- A collection of objects called
**structures**; - A notion of
**validity**of $\mathcal L$-WFFs in these structures.

Often, a **formal semantics** provides these by using a lot of auxiliary definitions.

## Pages in category "Formal Semantics"

The following 29 pages are in this category, out of 29 total.

### C

- Definition:Constructed Semantics/Instance 1/Factor Principle
- Definition:Constructed Semantics/Instance 1/Rule of Addition
- Definition:Constructed Semantics/Instance 1/Rule of Commutation
- Definition:Constructed Semantics/Instance 1/Rule of Idempotence
- Definition:Constructed Semantics/Instance 2/Factor Principle
- Definition:Constructed Semantics/Instance 2/Rule of Addition
- Definition:Constructed Semantics/Instance 2/Rule of Commutation
- Definition:Constructed Semantics/Instance 3/Factor Principle
- Definition:Constructed Semantics/Instance 3/Rule of Commutation
- Definition:Constructed Semantics/Instance 3/Rule of Idempotence
- Definition:Constructed Semantics/Instance 4/Factor Principle
- Definition:Constructed Semantics/Instance 4/Rule of Addition
- Definition:Constructed Semantics/Instance 4/Rule of Idempotence
- Definition:Constructed Semantics/Instance 5/Rule of Addition
- Definition:Constructed Semantics/Instance 5/Rule of Commutation
- Definition:Constructed Semantics/Instance 5/Rule of Idempotence

### S

- Satisfiable iff Negation is Falsifiable
- Satisfiable Set minus Formula is Satisfiable
- Satisfiable Set Union Tautology is Satisfiable
- Semantic Consequence is Transitive
- Semantic Consequence of Set minus Tautology
- Semantic Consequence of Set Union Formula
- Semantic Consequence of Superset
- Subset of Satisfiable Set is Satisfiable
- Superset of Unsatisfiable Set is Unsatisfiable