Formal Logic & Semantic Systems

← Back to Domain-Specific Families

Abstractions about formal systems for reasoning and meaning — logical frameworks and their laws (De Morgan's laws, infinitary logic, computability logic), semantic theories of language and formal systems (dynamic semantics, operator grammar), and formal methods for specification and computation (B-Method, conjunctive query, false position method).

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

• Abstract object theory — Abstract object theory (AOT) is a branch of metaphysics regarding abstract objects.
• B-Method — The B-Method is a method of software development based on B, a tool-supported formal method based on an abstract machine notation, used in the development of computer software.
• Computability logic — Computability logic (CoL) is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic, which is a formal theory of truth.
• Conjunctive query — In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.
• De Morgan's Laws — In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference.
• Deductive-nomological model — The deductive-nomological model (DN model) of scientific explanation, also known as Hempel's model, the Hempel–Oppenheim model, the Popper–Hempel model, or the covering law model, is a formal view of scientifically answering questions asking, "Why...?".
• Dynamic semantics — Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.
• False position method — In mathematics, the regula falsi, method of false position, or false position method is a family of algorithms used to solve linear equations and smooth nonlinear equations for a single unknown value.
• Fitch's paradox of knowability — Fitch's paradox of knowability is a puzzle of epistemic logic.
• Infinitary Logic — An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs.
• Mathematical fallacy — In mathematics, certain kinds of mistaken proof are often exhibited, and sometimes collected, as illustrations of a concept called mathematical fallacy.
• Minimizer — In linguistics, a minimizer is a word or phrase that denotes a very small quantity which is used to reinforce negation.
• Obfuscation — Obfuscation is the obscuring of the intended meaning of communication by making the message difficult to understand, usually with confusing and ambiguous language.
• Operator grammar — Operator grammar is a mathematical theory of human language that explains how language carries information.
• Quantifier variance — The term quantifier variance refers to claims that there is no uniquely best ontological language with which to describe the world.
• Semantics (logic) — In logic, the semantics or formal semantics is the study of the meaning and interpretation of formal languages, formal systems, and (idealizations of) natural languages.
• Square of opposition — In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.
• Squiggle operator — In formal semantics, the squiggle operator \sim is an operator that constrains the occurrence of focus.