TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| A | |
| algebraic semantics | |
| algebraizable logic | |
| Almukand-Nelson's system N4 | |
| American Plan | |
| analytic cut | |
| anti-Boolean algebras | |
| Aristotle's and Boethius's theses | |
| Australian Plan | |
| automatic proves | |
| axiomatization | |
| B | |
| binary quantifier for definite descriptions | |
| bisequent calculus | |
| bisimulation | |
| Boolean algebra | |
| Boolean connexive logic | |
| Boolean modal connexive logic | |
| Boolean Negation | |
| Boolean non-Fregean logic WB | |
| bounded cut | |
| C | |
| CEGAR-tableaux | |
| Chrysippian implication | |
| Classical Logic | |
| Coalition Logic | |
| completeness | |
| Completeness theorem | |
| computational complexity | |
| conditional logic CK | |
| connection relation | |
| connexive counterpart theory | |
| connexive extensions of PSC | |
| connexive implication | |
| Connexive logic | |
| connexive logics with the falsity constant ⊥ | |
| Constructive negation | |
| content relevance | |
| contra-classical logic | |
| contradictory logics | |
| countermodels | |
| counterpart relation | |
| counterpart theory | |
| Curry-Howard correspondence | |
| cut elimination | |
| cut rule | |
| Cut-elimination | |
| cut-elimination and decidability | |
| Cut-elimination theorem | |
| D | |
| Decidability | |
| decision procedure | |
| definite descriptions | |
| definiteness | |
| density rule | |
| dialetheism | |
| discriminator variety | |
| discursive logic | |
| discussive logic | |
| double negation elimination | |
| Duality | |
| E | |
| embedding | |
| epistemic logic | |
| equality | |
| everyday reasoning | |
| exponential time | |
| F | |
| Facebook logic | |
| feminist logic | |
| finitary consequence relation | |
| finite axiomatizations | |
| Finite Models | |
| First Order Logic | |
| first-order logic | |
| foundations of geometry | |
| foundations of mathematics | |
| four-valued logic | |
| free logic | |
| G | |
| GCLC | |
| H | |
| Hilbert-style system | |
| history of connexive logic | |
| hybrid logic | |
| hyperfinite sum | |
| hypersequent calculus | |
| I | |
| incomplete descriptions | |
| indivisibles | |
| inferential erotetic logic | |
| infinitesimals | |
| intuitionism | |
| intuitionistic linear logic | |
| intuitionistic logic | |
| K | |
| keyword 1 | |
| keyword 2 | |
| keyword 3 | |
| knowability paradox | |
| Kripke semantics | |
| L | |
| Lambek calculus | |
| law of excluded middle | |
| Linear-time temporal logic | |
| logic of content | |
| logic of content relationship | |
| logic of paradox | |
| logics of classes | |
| M | |
| many-dimensional modal logic | |
| Many-valued logic | |
| McCall’s logic CC1 | |
| measurement | |
| Minimal Change Strategy | |
| Minimal logic | |
| mixed consequence relations | |
| modal logic | |
| Multimodal Lambek Calculus | |
| N | |
| natural deduction | |
| natural deduction in sequent style | |
| Natural deduction system | |
| Nelson logic | |
| Nested sequents | |
| neutral free logic | |
| Newton | |
| non-denoting expressions | |
| Non-deterministic Matrices | |
| Non-Fregean logics | |
| non-referring descriptions | |
| non-rigid term | |
| Non-transitivity | |
| Nonassociative Lambek Calculus | |
| nonclassical logic | |
| Normal modal logic S4 | |
| Normalization theorem | |
| P | |
| paracomplete logic | |
| paraconsistency | |
| paraconsistent logic | |
| paraconsitent Nelson's logic N4 | |
| Paradox | |
| partial type theory | |
| PLTL | |
| positive free logic | |
| Probabilistic puzzles | |
| probability | |
| proof search | |
| proof theory | |
| proof transformation | |
| proof-theoretic semantics | |
| proportion | |
| propositional linear-time temporal logic | |
| propositions-as-types principle | |
| Provability logic | |
| Q | |
| Quantum logic | |
| quantum mechanics | |
| queer feminist theories | |
| R | |
| recapture | |
| relating logic | |
| relating semantics | |
| Restricted Non-deterministic Matrices | |
| Revenge | |
| S | |
| SAT-solver | |
| semantic incompleteness | |
| Sequent calculus | |
| sequent system | |
| set theory | |
| skew monoidal categories | |
| social interactions of rational agents | |
| socratic proofs | |
| Sorites | |
| standard translation of CK into classical first-order logic | |
| status relevance | |
| strategic reasoning | |
| strict implication | |
| Strict/Tolerant Logic | |
| strictly-truth-inference | |
| Strong Negation | |
| Subexponentials | |
| Subformula property | |
| Subminimal logics | |
| Subminimal negation | |
| substructural logic | |
| Substructural Modalities | |
| Suszko's logic SCI | |
| T | |
| tableaux | |
| temporal reasoning | |
| term-modal logic | |
| Thales theorem | |
| the fundamental theorem of calculus | |
| the method of Socratic proofs | |
| three-valued logic | |
| truth-inference | |
| Twist sequent calculus | |
| U | |
| uniqueness | |
| V | |
| virtual domain | |
| virtual term | |
| W | |
| Wansing's connexive logic C | |
| weak extension | |
| Weak Kleene | |