Formal Models & Logical Foundations

← Back to Domain-Specific Families

Abstractions about building and verifying formal representations — modal and many-sorted logics (normal modal logic, S4, branching quantifiers), proof and model theory (cut elimination, quantifier elimination, non-standard models), set-theoretic hierarchies and large cardinals (cumulative hierarchy, huge cardinals), and correctness frameworks such as proof of correctness.

33 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Algebraic set — A set of points defined as the simultaneous zero locus of a family of polynomial equations, without an irreducibility requirement.
• Antihomomorphism — A map between operation-bearing structures that preserves a binary product in reversed order: the image of a product is the product of the images in the opposite order.
• Arithmetic operation — A rule-governed operation on numbers or number-like objects—such as addition, subtraction, multiplication, division, powers, roots, or logarithms—defined by its operands, domain, result, and closure conditions.
• Axiom of Dependent Choice — Assert an infinite coherent sequence whenever every element of a nonempty set has a permitted successor.
• Bayesian Network — Represent a joint probability law by a directed acyclic graph and one conditional distribution per variable given its parents.
• Branching Quantifier — A partially ordered quantifier prefix that represents independence among variable choices, allowing existential dependencies to branch rather than follow the single linear order of ordinary first-order quantification.
• Constructional System — A logical system in which every object or concept of a domain is constructed from a proper subset designated as its basis, exposing dependencies among the domain's conceptual elements.
• Cumulative Hierarchy — Build a set universe in ordinal stages by retaining earlier contents, adding all available subsets at successors, and uniting stages at limits.
• Cut-Elimination Theorem — For a specified proof calculus, every derivation using an intermediate cut formula can be replaced by a cut-free derivation of the same end judgment, when the calculus satisfies the theorem's rule conditions.
• Envelope (mathematics) — A locus tangentially contacted by varying members of a specified family of curves, subject to regularity and parameter-domain checks.
• Extraneous and Missing Solutions — Opposite solution-set errors in equation solving: a non-equivalent step admits candidates absent from the original equation or discards genuine solutions.
• Formal Model — An explicit symbolic representation of a target whose entities, states, relations, parameters, and transformations are governed by mathematical or logical rules so consequences can be derived, simulated, or checked.
• Functional Programming — A programming style that organizes computation around function application and composition, often emphasizing immutable data and explicit effects.
• Huge Cardinal — A huge cardinal is the critical point of an elementary embedding whose target is closed under sequences of length equal to the image of that cardinal.
• Indiscrete space — A topological space whose only open sets are the empty set and the entire underlying set, giving the coarsest topology and making distinct points topologically indistinguishable.
• Interval — An order-convex subset containing every ambient element between any two of its members.
• Maharam Algebra — A complete Boolean algebra admitting a strictly positive continuous submeasure, whether or not it admits a measure.
• Many-sorted logic — A formal logic whose language and structures partition objects into multiple sorts, restricting constants, variables, functions, predicates, substitution, and quantification to declared sort signatures.
• Newton–Okounkov body — A convex body associated, after choosing valuation or flag data, with a divisor or graded linear series on an algebraic variety, encoding asymptotic section growth and positivity in Euclidean geometry.
• Non-standard model of arithmetic — A non-standard model of arithmetic satisfies first-order Peano arithmetic while containing elements beyond every standard numeral.
• Normal modal logic — A normal modal logic contains all propositional tautologies and the distribution axiom K, and is closed under uniform substitution, modus ponens, and necessitation.
• Planar ternary ring — A coordinate algebra for projective planes consisting of a set with distinguished 0 and 1 and a ternary operation T satisfying five incidence-solving axioms, generalizing the field expression T(a,b,c)=ab+c.
• Principle of Explosion — A logic-relative consequence rule under which a proposition and its negation together entail any formula whatsoever.
• Proof of correctness — A mathematical demonstration that an algorithm satisfies a formal specification, separating partial correctness from the additional obligation to prove termination for total correctness.
• Quantifier Elimination — The property that every formula of a specified theory and language has a quantifier-free equivalent valid in all its models.
• S4 (logic) — The normal modal logic obtained from K by adding reflexivity and transitivity principles, characterizable by reflexive-transitive Kripke frames.
• Set Cover Problem — Given a finite universe and a family of subsets whose union is that universe, the optimization problem of selecting the fewest subsets that still cover every element, or the decision problem of whether a cover of size at most k exists.
• Simple Precedence Grammar — Use conflict-free precedence relations between grammar symbols to locate reducible handles.
• Stable Model Semantics — Interpret a normal logic program by retaining exactly the candidate atom sets reproduced by the least model of their own negation-free reduct.
• Synthetic geometry — A method of developing geometry from primitive objects, incidence or order relations, and axioms, proving results without making coordinates the primary foundation.
• Tropical Projective Space — Tropical projective space identifies tropical coordinate tuples that differ by a common additive shift.
• Wandering set — A measurable set in a dynamical system whose distinct nonidentity translates are pairwise disjoint up to measure zero, thereby witnessing dissipative rather than recurrent behavior.
• Well-founded set — A binary relation on a set or class for which every nonempty subset has a minimal element, equivalently under suitable choice principles one admitting no infinite descending chain.