Logical Inference, Modality & Conditional Structures

← Back to Domain-Specific Families

Abstractions that define validity, status, or dependency through formal or conditional rules — modal and metaphysical status (logical possibility, grounding), inference and quantification (modus ponens, material conditional, existential quantification), self-reference and contrast failures (liar paradox, distinction without a difference), and rule-governed branching such as guards.

27 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.

• Accidental necessity — The disputed modal status according to which a contingent event, once past, is now unalterably or necessarily the case though it was not necessary before occurring.
• Alternative facts — A political-media euphemism coined in a January 2017 interview to defend a demonstrably false factual claim by recasting it as an alternative account, later generalized as a label for misinformation and reality-displacing rhetoric.
• Amor fati — An affirmative practical attitude that loves one's fate by willing the whole of one's life—including suffering, loss, contingency, and recurrence—rather than merely enduring or resigning oneself to it.
• Cambridge change — A gain or loss of a predicate by an object that occurs solely because another object or relation changes, while the first object's relevant intrinsic constitution remains unchanged.
• Circular reporting — False confirmation produced when multiple reports appear independent but ultimately repeat information from the same originating source.
• Conditional (Computer Programming) — A language construct selects a program branch or value by testing a condition and evaluating the selected alternative.
• Dative Case — A grammatical case or case-like marking whose central uses identify a recipient, beneficiary, experiencer, possessor, goal, or other language-specific non-agent relation, with form and syntactic status determined by each language.
• Distinction without a Difference — An argumentative contrast offered as a reason for different treatment when it makes no difference under the criterion that governs the conclusion.
• Empty category principle — A Government-and-Binding-era syntactic constraint requiring DP-traces and wh-traces—but not PRO or pro—to be properly governed through theta-government or antecedent-government.
• Existential Quantification — Bind a variable to assert that at least one object in a logical domain satisfies a specified formula.
• Grounding (metaphysics) — A non-causal metaphysical dependence relation in which one fact or entity obtains in virtue of more fundamental grounds.
• Guard (computer science) — A Boolean condition that controls whether a branch, transition, command, pattern, or procedure body may execute, including early guard clauses that reject unmet preconditions before the main logic while preserving explicit control-flow and side-effect semantics.
• Information exchange — The transfer of encoded information from one person, organization, or technical entity to another through an agreed channel, format, and interpretation context.
• Liar Paradox — A truth-status contradiction arising when a sentence directly or indirectly says of itself that it is false or not true under sufficiently strong truth principles.
• Logical graph — Peirce's existential-graph notation and calculus, in which logical assertions are arranged spatially on a sheet using juxtaposition, enclosure by cuts, identity lines, and transformation rules rather than only linear formulas.
• Logical possibility — The status of a proposition that is satisfiable or at least not refutable under the axioms, inference rules, semantics, and consistency policy of a specified logical system.
• Material conditional — The truth-functional binary connective P→Q that is false only when P is true and Q is false, and otherwise true, classically equivalent to ¬P∨Q.
• Modus ponens — The valid inference rule that from a conditional P → Q and its antecedent P derives the consequent Q, with validity determined by the conditional's formal system and not by the empirical truth, relevance, or persuasiveness of the premises.
• Obligationes — A medieval rule-governed disputation in which a respondent temporarily accepts a positum and must grant, deny, doubt, or distinguish successive propositions consistently while an opponent probes for contradiction.
• Operator (computer programming) — A programming-language construct whose notation, arity, precedence, evaluation rules, and semantics combine operands in ways that may differ materially from an ordinary function call.
• Polyvariance — A static-analysis design that retains distinct abstract approximations for selected calling contexts or value origins instead of merging them into one state.
• Principal type — The most general type or type scheme assignable to a term in a fixed environment, such that every other valid type for that term is obtained as an instance of it.
• Proof calculus — A formal proof framework specifying admissible formulas, axioms or assumptions, and inference-rule patterns for deriving theorems.
• Propositional logic — A formal logic that treats whole propositions as truth-valued atoms and builds compound formulas with connectives, deriving validity, equivalence, satisfiability, and consequence from their truth-functional structure.
• Second-Order Predicate — A predicate whose argument position ranges over a first-order predicate, concept, relation, or set rather than only over individual objects.
• Suppressed Correlative — A fallacy in which one member of an intended contrast is redefined so broadly that it absorbs the other, making the distinction vacuous and eliminating the alternative by stipulation.
• The Heresy of Paraphrase — A poem's extracted prose message is not equivalent to its meaning when the poem makes meaning through the ordered play of imagery, tone, and tensions worked through in the poem.