TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| A | |
| Abstract Elementary Classes | |
| Abstract Model Theory | |
| Ackermann's Function | |
| Admissible computability | |
| admissible rule | |
| admissible rules | |
| Algebraic structure | |
| Algorithmic randomness | |
| amalgamation | |
| ample generics | |
| analysis | |
| Analytical hierarchy | |
| approximation spaces | |
| Argumentation | |
| Aristotle | |
| arithmetic | |
| Arithmetical hirarchy | |
| Arithmetized Completeness Theorem | |
| Artin-Schreier extensions | |
| autostability | |
| axiom of determinacy | |
| Axiomatics | |
| axiomatization | |
| B | |
| back-and-forth | |
| Banach space | |
| behavior of 2-formulas | |
| belief change | |
| Bernays | |
| Beth definability property | |
| BHK | |
| bi-immunity | |
| bisimulation | |
| Bisimulation Quantifiers | |
| Boolean algebra | |
| Borel flows | |
| bounded arithmetic | |
| bounded morphisms | |
| bounded ultrapower | |
| C | |
| C. I. Lewis | |
| canonicity | |
| Cantor | |
| Cantor's Diagonal Argument | |
| Cantor's Theorem | |
| Cantor-Bendixson rank | |
| cardinal invariants | |
| cardinality | |
| categoricity | |
| Caucal hierarchy | |
| ce degrees | |
| characteristic formulae | |
| Characterizing Cardinals | |
| chromatic number | |
| Church Rule | |
| Church-Fitch | |
| Cichoń's diagram | |
| circuit lower bounds | |
| circularly ordered structure | |
| class of structures | |
| classes | |
| classical logic | |
| Classical Propositional Logic | |
| classification theory | |
| clones with constants | |
| co-analytic sets | |
| coding | |
| collection scheme | |
| Coloring number | |
| compactness | |
| Complete lattices | |
| completeness | |
| completeness for isomorphisms | |
| completeness theorem | |
| Completeness theorems | |
| completions | |
| complexity | |
| complexity theory | |
| complexity-theoretic hierarchies | |
| computability | |
| computability theory | |
| computable analysis | |
| computable categoricity | |
| computable dimension | |
| computable functions | |
| Computable linear order | |
| Computable linear orderings | |
| computable model theory | |
| Computable numbering | |
| computable numberings | |
| computable structure | |
| computable structure theory | |
| computably enumerable equivalence relations | |
| computably enumerable graphs | |
| Computer Science Education | |
| Constructive logic | |
| constructive mathematics | |
| constructive reverse mathematics | |
| Contradictions | |
| Countably categorical structures | |
| CPA | |
| cross-sections of flows | |
| D | |
| Davies-trees | |
| decidability | |
| Deep relevant logics | |
| definability | |
| definable groups | |
| Definable well-orders | |
| degree | |
| degree of autostability | |
| Degree spectra | |
| degree spectra of relations | |
| degree spectrum | |
| degree structure | |
| degree theory | |
| demonstration | |
| Denjoy integration | |
| dependence logic | |
| Depth relevance | |
| Descriptive set theory | |
| determinacy | |
| Diagonalization | |
| diagonally non-computable | |
| diagrams | |
| Dialectic Logic | |
| Difference hierarchy | |
| differentiability | |
| Differential fields | |
| Differentiation | |
| Disjunction Property | |
| display type calculus | |
| distributivity | |
| DNC | |
| Dominating Functions | |
| domination | |
| Double negation shift | |
| doxastic logic | |
| dynamic logic | |
| dynamical model | |
| E | |
| effective bi-immunity | |
| effective bounds | |
| effectivity properties | |
| Elections | |
| elementary epimorphism | |
| elementary indivisibility | |
| elementary submodels | |
| Emil Post | |
| end-extensions | |
| enumeration | |
| enumeration degrees | |
| enumeration of family | |
| enumeration operator | |
| enumeration reducibility | |
| epistemic entrenchment | |
| epistemic logic | |
| Epistemic reasoning | |
| equations over types | |
| Equivalence relations | |
| Ershov hierarchy | |
| Euclid's Theorem | |
| excellence | |
| Existence Property | |
| existential interpretation | |
| existentially closed model | |
| Explicit Mathematics | |
| explosiveness | |
| exponentiation | |
| Extended Church Principle ECT and the Uniformization Principle UP | |
| extensions of models | |
| External Numbers | |
| Extreme amenability | |
| F | |
| Failures of the GCH | |
| Fan Functional | |
| field theory | |
| Fields | |
| finite inseparability | |
| finite mixtures | |
| Finite model property | |
| finite variable fragments | |
| First Order Monadic Logic | |
| first-order | |
| first-order logic | |
| first-order modal logic | |
| fixed point operators | |
| Fixed-Points | |
| forcing | |
| Forcing axioms | |
| Forking | |
| Formal models | |
| formula | |
| Foundations of Logic | |
| Foundations of Mathematics | |
| Fragments of arithmetic | |
| fragments of MA | |
| Fraisse limits | |
| Frege | |
| full intuitionistic linear logic | |
| function fields | |
| Fundamental Sequences | |
| fuzzy | |
| G | |
| Galois theory | |
| Galoius Types | |
| Game theory | |
| game-theoretical semantics | |
| Games | |
| games in logic | |
| Gappiness | |
| General logic | |
| general relativity | |
| generalized computability | |
| generalized rational grading | |
| generalized truth value | |
| generic extensions | |
| genericity | |
| Glivenko's theorem | |
| Glivenko’s theorem | |
| Godel negative translation | |
| graded modal logic | |
| Graph calculi | |
| graph-based formulas | |
| grounded Martin's axiom | |
| Guarded fragment | |
| Gödel 3-valued logic | |
| H | |
| Hallden completeness | |
| Hereditarily finite superstructure | |
| Heyting's logic | |
| hierarchy of norms | |
| hilbert | |
| Hilbert's Tenth Problem | |
| History of Logic | |
| Hoare's logic | |
| homogeneous frames | |
| homogeneous models | |
| homogeneous structures | |
| honest elementary degrees | |
| Hrushovski construction | |
| Hybrid Logic | |
| hyperarithmetic hierarchy | |
| hyperarithmetical hierarchy | |
| I | |
| Ideal | |
| ideals | |
| IF logic | |
| implicative fragment | |
| implicit commitment | |
| Incompleteness | |
| independence | |
| Indiscernibles | |
| Indivisibility | |
| Induction schemes | |
| Inductive definition | |
| Infinitary Logic | |
| infinitary proof theory | |
| information economy principle | |
| inner models | |
| instance reducibility | |
| Intermediate Logics | |
| intermediate models | |
| Intermediate Predicate logics | |
| interpolation property | |
| intuitionistic logic | |
| intuitionistic set theory | |
| inverse limit | |
| Invited talk | |
| isomorphism problem | |
| J | |
| Jonsson theories | |
| jump | |
| jump inversion | |
| Justification Logic | |
| K | |
| Kechris-Woodin rank | |
| Kleene logic | |
| Klein four group | |
| Knowability Paradox | |
| Knowledge | |
| Kripke semantics | |
| L | |
| Large cardinals | |
| lattice of truth values | |
| Lebesgue orbit equivalence | |
| left-c.e. real | |
| lexicographic product | |
| Liar | |
| lie groups | |
| limitwise monotonic degree | |
| Limitwise monotonic function | |
| limitwise monotonic functions | |
| limitwise monotonic reducibility | |
| limitwise monotonic set | |
| linear logic | |
| Linear Temporal Logic | |
| List-chromatic number | |
| logic | |
| logic education | |
| Logic of Proofs | |
| Lorentzian manifolds | |
| low and high degrees | |
| lower bounds | |
| M | |
| majority operators | |
| many-valued | |
| Many-valued logics | |
| Many-valued modal logic | |
| Marker's extensions | |
| Markov Principle M | |
| Markov Rule | |
| mathematical knowledge | |
| mathematical logic | |
| Mathematical progress | |
| Mathias model | |
| Matrix iterations | |
| measurable cardinals | |
| Memory Logics | |
| mereology | |
| mereotopology | |
| metamathematics | |
| metric abstract elementary classes | |
| metric structures | |
| Minimal numbering | |
| minimal numberings | |
| modal consequence operations | |
| modal logic | |
| Modal logics | |
| model | |
| model existence | |
| model theory | |
| modern proof theory | |
| monadic second-order | |
| monotone modal logic | |
| Monotone operator | |
| Morley sequences | |
| mu-calculus | |
| multi type calculus | |
| N | |
| n-dependent theories | |
| naive set theory | |
| naive truth | |
| naive types | |
| Nash equilibria | |
| natural deduction | |
| negative translations | |
| Nice enumerations | |
| Noetherian spaces | |
| Non-classical Logic | |
| non-elementary classes | |
| non-standard models | |
| nonexpansive iterations | |
| Nonstandard Analysis | |
| normal modal logics | |
| Normal multi-modal logics | |
| Numbers | |
| numerical existence property | |
| O | |
| o-minimality | |
| omega enumeration degrees | |
| omega-stable structure | |
| optimisation | |
| order dimension | |
| Orders of Magnitude | |
| ordinal notation system | |
| Ordinal notations | |
| Orthogonality | |
| P | |
| Paracomplete | |
| paraconsistency | |
| Paradox | |
| Parallelism | |
| Partial conservativity (of the theory T over the | |
| PDL | |
| perfect Jonsson theory | |
| Philosophy | |
| philosophy of mathematics | |
| Polish groups | |
| Polish structure | |
| Posets | |
| Predicative mathematics | |
| pregeometries | |
| Pregeometry | |
| Primitive Conditional Connective | |
| probabilistic logic | |
| program verification | |
| projective determinacy | |
| projective plane | |
| projective unification | |
| proof complexity | |
| proof complexity of strong equal tautologies | |
| proof mining | |
| proof systems of modal propositional logic | |
| proof theory | |
| Proof-theoretic methods | |
| properties of graph structures | |
| Provability Logic | |
| Pseudo-algebraically non-separable closed fields | |
| Q | |
| quantifier elimination | |
| quasi-varieties | |
| quasiminimal structures | |
| quaternion | |
| R | |
| r.e. degrees | |
| Ramsey null | |
| Ramsey theory | |
| Randomness | |
| Real fields | |
| realizability | |
| reals | |
| Reasoning in Fiction | |
| recursion theory | |
| reducibility | |
| Reduct | |
| Reference | |
| Reflection principle | |
| reflection principles | |
| relativity theory | |
| renaissance geometry | |
| representative agent | |
| Resource lambda-calculus | |
| resource sensitive logics | |
| Restrictiveness | |
| reverse mathematics | |
| Roger semilattice | |
| Rogers semilattice | |
| Routley-Meyer semantics | |
| Russell's Paradox | |
| S | |
| Safety relation | |
| satisfiability | |
| scattered linear order | |
| second order logic | |
| second-order arithmetic | |
| Self-reference | |
| semantic entailment | |
| semantic model | |
| semantics | |
| semilattice | |
| separation logic | |
| sequent calculus | |
| sequential theories | |
| set theory | |
| sets | |
| Sheaf semantics | |
| Sigma-definability | |
| Sigma-predicate | |
| similarity | |
| Simple theories | |
| Social Choice | |
| Sorites | |
| soundness | |
| spectra | |
| spectra of structures | |
| stability | |
| strong equality of modal tautologies | |
| structural completeness | |
| structure | |
| subrecursive degrees | |
| substructural logic | |
| Substructural predicate logics | |
| superstability | |
| symmetric indivisibility | |
| synthesis | |
| T | |
| Tableau | |
| tame structures | |
| template iterations | |
| temporal logic | |
| termspace forcing | |
| the bar induction | |
| The theory of subsets of $\omega_1$ | |
| Theories of interpretation | |
| theory of almost sure validities | |
| Theory of Play | |
| theory S relative the class of formulae C) | |
| topological dynamics | |
| Topos theory | |
| transfer theorem | |
| trees | |
| Truth | |
| Tukey | |
| Turing operator | |
| Turing reducibility | |
| Turing's Halting Problem | |
| U | |
| UD-randomness | |
| ultrafilter | |
| undecidability | |
| uniform distribution | |
| Uniform Interpolation | |
| Uniformization | |
| Uniformization Rule | |
| universal numbering | |
| Upper bounds | |
| V | |
| vagueness | |
| von Neumann's Minimax theorem | |
| W | |
| Wadge-like hierarchies | |
| weak arithmetic | |
| weak circular minimality | |
| Weak relevant model structures | |
| Weihrauch degree | |
| Weihrauch reducibility | |
| wqo theory | |
| WWKL | |
| Y | |
| Yablo's Paradox | |
| Z | |
| zero-one laws | |
| Σ | |
| Σ^0_2-sets | |