• README ⤓ .txt 2026-07-17T121634.146 000000000000688
  Logics developed for, or specialized to, a particular domain of application. Each entry retains an explicit consequence or validity relation, but its connectives, semantics, and intended models are shaped by the subject matter it serves—computation, knowledge, language, probability, games, quantum systems, or program verification.
• Computation
  Logics and calculi that give formal meaning to the behavior of programs and processes: how computation proceeds, what a program denotes, and how concurrent and mobile systems interact.
• Game
  Logics whose semantics or subject matter is strategic interaction: systems in which truth, provability, or meaning is cast as the existence of a winning strategy, and logics for reasoning about games, strategies, and coalitions.
• Knowledge
  Logics for representing knowledge and drawing inferences from it, especially the defeasible, nonmonotonic, and ontological reasoning that formal knowledge systems require.
• Probabilistic
  Logics that integrate probability, uncertainty, and causation into formal reasoning: systems that attach degrees of belief or chance to formulas, combine logic with probabilistic models, or formalize causal and counterfactual inference.
• Quantum
  Logics and calculi individuated by quantum structure: systems whose connectives, states, or processes reflect the non-classical algebra of quantum mechanics—non-distributive lattices of propositions, effect algebras, and the diagrammatic calculi of quantum information.
• Semantics
  Formal logics and calculi built to model the meaning of natural language: systems of compositional interpretation, discourse dynamics, quantification, and the pragmatic phenomena that a truth-conditional theory of meaning must handle.
• Spatial
  Logics and calculi whose intended models are regions, points, and their spatial relations: containment, connection, contact, boundary, and distance.
• Verification
  Logics and calculi for proving programs correct or incorrect: assertion-based reasoning about state, resource, and concurrency, and the automated methods that check temporal and reachability properties of systems.
• CRITERIA ⤓ .txt 2026-07-17T120407.600 000000000000704
  Not sufficient: A general-purpose logic with no domain specialization (that belongs in Algebraic, Modal, Structural, Type, or Team). A bare axiomatization with no domain orientation (that belongs in Theories). A metatheoretic result about such logics (that belongs in Metatheory). An argumentation practice without a defined consequence relation (that belongs in the Argumentation and Rhetoric collection).