{"query": "Boolean algebra / propositional logic", "count": 8, "results": [{"id": "card_theory_boolean_algebra_propositional_logic", "title": "Boolean algebra / propositional logic", "shelf": "theories", "surface": "secular", "snippet": "Boolean algebra / propositional logic — an engine domain that can touch it: formal_logic. Calibration: seals. Two values and three operations — AND, OR, NOT — with laws of their own (De Morgan's, dist", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_bridge_theory_boolean_algebra_propositional_logic__formal_logic_epistemology", "title": "Bridge: Boolean algebra / propositional logic  ↔  Formal logic & epistemology (validity, inference)", "shelf": "bridges", "surface": "secular", "snippet": "Boolean algebra / propositional logic and Formal logic & epistemology (validity, inference) are the same form in different domains. Boole's algebra IS propositional inference in arithmetic dress: AND/", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_bridge_hub_boolean_algebra_propositional_logic", "title": "Hub: Boolean algebra / propositional logic carries 4 domains", "shelf": "bridges", "surface": "secular", "snippet": "Calculations from 4 different domains (computer_science, formal_logic, mathematics, rhetoric) all rest on Boolean algebra / propositional logic — one theory holding up many fields.", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_bridge_master_boolean_algebra", "title": "Master equation: (a AND b), (a OR b), NOT a  —  the two-valued algebra", "shelf": "bridges", "surface": "secular", "snippet": "the law of thought made algebra: the same AND/OR/NOT structure is propositional logic, a network of switches, and the algebra of sets. Boole titled it The Laws of Thought; Shannon showed a circuit IS ", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_n_e7c1d7f721bb", "title": "Gödel — why a calibration tool must point beyond itself", "shelf": "science", "surface": "secular", "snippet": "Kurt Gödel — the deepest logician since Aristotle — proved two things this whole engine rests on,\nand together they are the mathematics of a calibration tool for alignment to source through Jesus Chri", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-10", "readable": false, "generated": false}, {"id": "card_src_word_propositional_logic", "title": "propositional logic", "shelf": "dictionary", "surface": "secular", "snippet": "propositional logic: (noun) a branch of symbolic logic dealing with propositions as units and with their combinations and the connectives that relate them — syn: propositional calculus", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_src_word_propositional_calculus", "title": "propositional calculus", "shelf": "dictionary", "surface": "secular", "snippet": "propositional calculus: (noun) a branch of symbolic logic dealing with propositions as units and with their combinations and the connectives that relate them — syn: propositional logic", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_src_mill_marques_silva_sakallah_1999", "title": "J. P. Marques-Silva 1999 — GRASP: a search algorithm for propositional satisfiability", "shelf": "millennium", "surface": "secular", "snippet": "J. P. Marques-Silva, K. A. Sakallah (1999). GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48 (1999) 506–521. DOI 10.1109/12.769433. Canonical: https://doi.org/10.1109", "authority_tier": "reference", "source": "J. P. Marques-Silva, K. A. Sakallah (1999), IEEE Trans. Comput. 48 (1999) 506–521", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_theory_boolean_algebra_propositional_logic"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}