Mathematical Logic Foundations

Constructive Type Theory and Dependent Types

Studies formal systems where propositions are types and proofs are computational terms, focusing on constructive mathematics without classical logic.

RESEARCH GAP FRONTIERS

Homotopy Type Theory Foundations

Investigates the connection between type theory and homotopy theory, treating types as topological spaces with higher-dimensional structure.

RESEARCH GAP FRONTIERS

Proof Mining and Computational Content

Extracts algorithmic information from classical proofs to obtain constructive bounds and explicit computational content.

RESEARCH GAP FRONTIERS

Modal Logic and Necessity Operators

Explores logical systems for reasoning about possibility, necessity, and knowledge using modal operators and accessibility relations.

RESEARCH GAP FRONTIERS

Linear Logic and Resource Semantics

Studies logical systems where formulas represent consumable resources, with applications to computation and quantum logic.

RESEARCH GAP FRONTIERS

Categorical Logic and Topoi

Develops logic within the framework of category theory, treating logical structures as objects in categorical universes called topoi.

RESEARCH GAP FRONTIERS

Infinitary Logic and Admissible Sets

Examines logical systems allowing infinite conjunctions and disjunctions, connecting to recursive ordinals and admissible ordinals.

RESEARCH GAP FRONTIERS

Reverse Mathematics and Proof Strength

Determines which axioms are necessary and sufficient to prove classical theorems by working backwards from conclusions to minimal assumptions.

Computability Theory and Turing Degrees

Studies the hierarchy of computational difficulty through Turing degrees and explores which problems are algorithmically decidable.

Descriptive Set Theory and Borel Hierarchies

Investigates the complexity classification of sets in Polish spaces using Borel, analytic, and projective hierarchies.

Forcing and Independence Results

Studies Cohen''s forcing technique to construct models of set theory where specific statements are independent of standard axioms.

Inner Models and Constructibility

Analyzes Godel''s constructible universe and develops inner models to understand the consistency of various set-theoretic axioms.

Large Cardinal Axioms and Rank

Explores axioms asserting the existence of large cardinals and their implications for mathematical structure and consistency strength.

Infinite Combinatorics and Ramsey Theory

Studies partition properties of infinite sets and the structural guarantees provided by Ramsey-type theorems in set theory.

Ordinal Analysis and Proof-Theoretic Strength

Assigns ordinals to formal systems to measure their proof-theoretic strength and compare consistency via ordinal notation systems.

Substructural Logics and Ordered Sequents

Investigates logical systems weakening structural rules like contraction and weakening, with applications to relevance and bunched implication.

Intuitionistic Logic and Constructive Semantics

Develops proof systems and semantics for intuitionistic logic where truth requires constructive evidence and rejects the law of excluded middle.

Fuzzy Logic and Many-Valued Systems

Studies logical systems with truth values in continuous intervals or lattices, modeling vagueness and partial truth.

Temporal Logic and Program Verification

Develops logical frameworks for reasoning about time and changes, with applications to verifying concurrent and reactive systems.

Description Logics for Knowledge Representation

Creates decidable fragments of first-order logic optimized for knowledge bases, enabling automated reasoning in ontologies.

Non-monotonic Logic and Default Reasoning

Studies logical systems where adding new information can invalidate previous conclusions, modeling defeasible and commonsense reasoning.

Paraconsistent Logic and Contradiction Tolerance

Develops logical systems tolerant of contradictions without explosion, allowing reasoning in inconsistent domains.

Relevant Logic and Logical Dependency

Explores logical systems where conditionals require genuine relevance between antecedents and consequents, rejecting irrelevant implications.

Quantum Logic and Orthomodular Lattices

Develops logical frameworks for quantum mechanics based on orthomodular lattices, addressing non-distributivity in quantum propositions.

Automata Theory and Formal Languages

Studies computational devices and their corresponding language classes, connecting automata to logical definability and complexity.

Lambda Calculus and Functional Semantics

Investigates the lambda calculus as a foundational model of computation, studying reduction strategies and semantic interpretations.

Curry-Howard Correspondence Extensions

Extends the proofs-as-programs correspondence to richer logical systems, connecting classical logic to control operators.

Model Theory and Categorical Equivalence

Studies the relationship between logical theories and their models, determining when models are indistinguishable by logical formulas.

Stability Theory and Classification

Analyzes first-order theories through stability and other dividing lines, classifying their model-theoretic complexity.

Simplicity and Tameness in Model Theory

Studies simple theories and variants like rosy theories that enjoy tame model-theoretic properties and structural control.

Saturation and Homogeneity Properties

Investigates saturated models and homogeneous structures, essential tools for understanding model-theoretic phenomena.

Definability and Interpretability Results

Studies which structures are definable or interpretable in others, establishing fundamental boundaries of logical expressibility.

Ultrafilters and Nonstandard Analysis

Uses ultraproducts and ultrafilters to construct nonstandard models enabling infinitesimal and infinite number reasoning.

Stability Spectrum and Categoricity

Examines theories categorical in various cardinalities and their stability properties across the cardinality spectrum.

Recursive Function Theory and Hierarchies

Studies the arithmetical and analytical hierarchies classifying the complexity of predicates definable with quantifier alternation.

Incompleteness Theorems and Self-Reference

Explores Godel''s incompleteness results and self-referential mechanisms underlying fundamental limitations of formal systems.

Decidability and Undecidability of Theories

Determines which mathematical theories admit algorithms for truth-value determination and which are computationally undecidable.

Constraint Logic Programming Foundations

Studies logical frameworks combining logic programming with constraint satisfaction, enabling declarative specification of complex problems.

Abstract Logic and Lindstrom Theorems

Develops general theory of logical systems and characterizes first-order logic as maximal by its compactness and completeness.

Generalized Quantifiers and Logical Extensions

Studies extensions of first-order logic with generalized quantifiers like Mostowski and branching quantifiers, expanding expressive power.

Algebraic Logic and Cylindric Algebras

Represents logical systems algebraically through cylindric algebras and polyadic algebras, connecting logic to universal algebra.

Boolean Algebras and Stone Duality

Studies Boolean algebras and their dual representations as Stone spaces, fundamental to logical and topological aspects.

Lattice Theory and Logical Order

Investigates lattices as algebraic structures underlying logical systems, including distributivity and completeness properties.

Formal Epistemology and Justification Logic

Develops logical systems explicitly tracking justifications for beliefs, formalizing epistemic principles with proof-like objects.

Dynamic Epistemic Logic and Updates

Studies how knowledge changes through information updates, combining modal logic with dynamic action logic.

Doxastic Logic and Belief Dynamics

Formalizes belief reasoning through doxastic operators, investigating how beliefs should rationally revise with new information.

Social Choice Logic and Preference Aggregation

Applies logical formalisms to social choice theory, analyzing impossibility results and preference aggregation mechanisms.

Logical Foundations of Probability Theory

Develops logical systems for probabilistic reasoning, connecting mathematical probability to logical inference and uncertainty.

Formal Semantics and Compositionality

Applies logical methods to natural language semantics, studying how meanings compose according to syntactic structure.

Type-Theoretic Semantics of Language

Uses type-theoretic frameworks to model linguistic meaning and reasoning, connecting natural language to formal logic.

Synthetic Computability and Realizability Semantics

Investigates realizability interpretations of constructive logic and their connections to synthetic approaches in computability theory and constructive mathematics.

Topos Theory and Logical Foundations

Explores the use of topos-theoretic frameworks as foundations for mathematics, providing categorical semantics for intuitionistic logic and constructive mathematics.

Cubical Type Theory and Higher Inductive Types

Develops cubical computational type theory with emphasis on higher inductive types, univalence axioms, and computational interpretations of homotopical constructions.

Predicativity and Autonomous Transfinite Hierarchies

Studies predicative systems of set theory and type theory, investigating autonomous transfinite progressions and impredicative definitions in logical frameworks.

Proof Theoretic Ordinals and Transfinite Induction

Analyzes proof-theoretic ordinals associated with formal systems and their applications to measuring consistency strength and expressiveness of theories.

Intuitionistic Arithmetic and Friedman''s Metatheory

Examines constructive arithmetic systems and their metatheoretic properties, including proof transformations and computational content extraction techniques.

Gentzen Sequent Calculi and Proof Search

Develops extensions of Gentzen''s sequent calculi for diverse logical systems and investigates efficient proof search algorithms and cut-elimination procedures.

Analytic Combinatorics and Logical Recursion

Combines analytic combinatorics with recursive definitions in logical systems to study growth rates and enumerative properties of proof structures.

Structural Proof Theory and Display Logic

Investigates display logic and related structural proof systems designed to handle substructural logics with refined structural rules and connectives.

Coherence Problems in Higher Category Theory

Studies coherence conditions and coherence theorems arising in higher category theory and their logical implications for type-theoretic foundations.

Monadic Second-Order Logic and Tree Automata

Explores connections between monadic second-order logic and automata theory, including decidability results and applications to formal verification.

Computable Analysis and Effective Topology

Develops foundations for computable analysis using effective topology and Turing computability, bridging classical analysis with constructive methods.

Abstract Computability and Multi-Sorted Structures

Generalizes computability theory to abstract structures with multiple sorts, including higher-type computations and recursion over arbitrary domains.

Godel''s Incompleteness and Self-Reference Mechanisms

Analyzes self-reference and diagonalization techniques underlying incompleteness theorems, including generalizations and strengthened incompleteness results.

Peano Arithmetic and Transfinite Recursion

Investigates extensions of Peano arithmetic through transfinite recursion, including primitive recursive functions at higher ordinals and related systems.

Consistency Strength Hierarchies and Axiomatic Theories

Studies fine-grained consistency strength orderings of axiomatic systems using proof-theoretic methods and ordinal analysis techniques.

Kripke Semantics and Modal Completeness Theorems

Extends Kripke semantics to diverse modal and temporal logics, establishing completeness results and exploring frame correspondence theory.

Bunched Logic and Separation Logic

Develops bunched implications and separation logic for reasoning about resource usage and pointer aliasing in program verification.

Affine Logic and Linear Typing Systems

Investigates affine and linear type systems with applications to resource management, concurrent programming, and secure information flow.

Multiplicative-Additive Systems and Phase Semantics

Studies phase semantics and coherence spaces as models for fragments of linear logic combining multiplicative and additive structure.

Ludics and Interaction Semantics

Develops ludics as a semantics for linear logic based on interaction protocols and game-theoretic principles for proof representation.

Polarized Logic and Sequentialization

Investigates polarized systems in linear logic and related techniques for controlling proof search and establishing sequentialization theorems.

Concrete Domains and Feature Logic

Studies feature logic with concrete domains for knowledge representation, combining symbolic reasoning with continuous constraint satisfaction.

Closed-World Assumption and Negation-as-Failure

Examines logical foundations of negation-as-failure and closed-world assumptions in logic programming and their connections to stable semantics.

Answer Set Programming and Disjunctive Logic Programs

Develops logical foundations for answer set programming and disjunctive logic programs, including semantics and complexity analysis.

Abductive Logic and Hypothetical Reasoning

Formalizes abductive reasoning and hypothesis generation within logical frameworks, including applications to diagnosis and scientific inference.

Conditional Logic and Counterfactuals

Studies logical systems for conditional statements and counterfactual reasoning, including semantics based on similarity and sphere models.

Doxastic Revision and Belief Contraction

Investigates logical foundations of belief revision theory, including AGM-style contraction operators and related update semantics.

Probabilistic Logic and Markov Chains

Develops logical formalisms integrating probabilistic reasoning with Markov models, enabling quantitative analysis of uncertain systems.

Continuous Logic and Model Theory

Extends classical model theory to continuous logic with real-valued truth degrees, studying stability, categoricity, and definability in metric structures.

Omega-Logic and Second-Order Semantics

Investigates omega-logic and related infinitary logics with complete semantics, exploring their expressiveness and proof-theoretic properties.

Game Semantics and Innocent Strategies

Develops game semantics for higher-order languages using innocent strategies and explores connections to denotational and operational semantics.

Geometry of Interaction and Feedback

Studies the geometry of interaction framework emphasizing feedback operators and their applications to proof normalization and complexity analysis.

Differential Linear Logic and Derivatives

Develops differential linear logic incorporating differentiation operators for analyzing sensitivity and smooth changes in logical systems.

Girard''s Light Linear Logic and Complexity

Investigates light linear logic and related resource-conscious systems designed to characterize polynomial-time computable functions logically.

Elementary Linear Logic and Function Polynomials

Studies elementary linear logic capturing elementary functions and explores connections to complexity-theoretic characterizations of function classes.

Implicit Computational Complexity and Tiered Systems

Develops implicit characterizations of complexity classes using tiered type systems and resource-bounded logics without explicit bounds.

Subrecursion Theory and Fast-Growing Hierarchies

Analyzes subrecursive function classes using fast-growing hierarchies and Grzegorczyk hierarchies to characterize intermediate computational power.

Arithmetical Hierarchy and Analytical Hierarchy

Studies the arithmetical and analytical hierarchies of definable sets, including complete sets at each level and their logical characterizations.

Primitive Recursive Arithmetic and Proof Terms

Investigates primitive recursive arithmetic with explicit proof term calculi for extracting computational content from formal proofs.

Higher-Order Arithmetic and Impredicative Definitions

Studies impredicative second-order and higher-order arithmetic systems, analyzing their proof-theoretic strength and mathematical expressiveness.

Gentzen''s Consistency Proof and Transfinite Methods

Examines Gentzen''s consistency proof for arithmetic and its extensions using transfinite induction, foundational for modern ordinal analysis.

Cut-Elimination and Normalization Theorems

Develops cut-elimination procedures for diverse logical systems and establishes strong normalization results for proof reduction.

Normalization-by-Evaluation and Computational Semantics

Investigates normalization-by-evaluation techniques and their applications to deciding equality in type theories and extracting evaluated terms.

Dependent Pattern Matching and Unification Algorithms

Studies pattern matching in dependent type theories and develops unification algorithms for dependent function spaces and inductive types.

Inductive Types and Positivity Conditions

Analyzes inductive type definitions in type theory, characterizing positivity conditions ensuring well-foundedness and enabling structural recursion.

Coinductive Types and Guardedness in Type Theory

Investigates coinductive type definitions and guardedness conditions for productive infinite types, supporting bisimulation reasoning.

Observational Type Theory and Heterogeneous Equality

Develops observational type theories with heterogeneous equality allowing comparison of terms in different types based on observable behavior.

Quotient Types and Setoid Semantics

Studies quotient type construction in type theory using setoids and extensional equality, enabling reasoning about equivalence classes.

Universe Polymorphism and Type Universes

Investigates universe polymorphism and cumulative universes in type theory, addressing universe level management and impredicativity concerns.

Observational Type Theory and Extensionality

Study of type theories incorporating observational equivalence principles to achieve extensional properties without requiring strong axioms.

Dialectica Categories and Functional Interpretations

Analysis of Dialectica categorical semantics and their applications to extracting constructive content from classical proofs through functional interpretation.

Realizability Theory and Effective Topos

Study of realizability interpretations and the effective topos as models for constructive mathematics with applications to computability.

Predicative Foundations and Feferman Systems

Research on predicative subsystems of second-order arithmetic and their proof-theoretic strength relative to explicit mathematics frameworks.

Normalization and Strong Elimination Procedures

Development of normalization algorithms for pure type systems with applications to type checking and confluence analysis.

Girard''s Linear Logic Extensions

Exploration of extensions to linear logic including polarity, focusing, and applications to proof search and logical frameworks.

Bunched Logic and Separation Semantics

Study of bunched implications combining multiplicative and additive connectives with applications to program verification and resource management.

Ordered Linear Logic and Non-commutativity

Investigation of non-commutative variants of linear logic with applications to reasoning about ordered resources and process calculi.

Structural Proof Theory and Cut Elimination

Systematic study of cut elimination theorems across various proof systems including deep inference and nested sequent calculi.

Display Logic and Display Calculi

Research on display logic methodology providing uniform proof systems for diverse logics with automatic cut elimination properties.

Analytic Tableaux and Tableau Reasoning Systems

Development and optimization of tableau-based theorem proving methods with applications to automated reasoning in first-order and modal logics.

Resolution Methods and Saturation Strategies

Study of resolution-based automated reasoning with focus on saturation algorithms and their completeness properties.

Gödel''s Completeness and Extensions

Investigation of completeness phenomena across different logics including infinitary logics and their model-theoretic characterizations.

Arithmetic Hierarchy and Analytical Hierarchy

Study of definability levels in Peano arithmetic and second-order arithmetic with applications to classification of mathematical statements.

Hyper-arithmetic Sets and Higher Recursion

Research on higher-order recursion theory examining hyper-arithmetic and hyper-analytic sets with connections to proof theory.

Gentzen-style Systems for Substructural Logics

Development of sequent and natural deduction calculi for substructural logics with proper handling of structural rules.

Lambda Calculus Variants and Extensions

Study of typed and untyped lambda calculus variants including intersection types, union types, and dependent function spaces.

Process Algebra Semantics and Logical Foundations

Investigation of logical foundations for process algebras including behavioral equivalence characterization and temporal specifications.

Inductive-Recursive Definitions and Wellfoundedness

Study of inductive-recursive types in type theory with applications to defining mathematical structures with complex dependence patterns.

Coalgebra and Coinduction in Logic

Research on coalgebraic methods for reasoning about infinite structures and coinductive definitions in formal logic.

Girard''s Polymorphism and System F Extensions

Study of polymorphic type systems including rank restrictions, predicative polymorphism, and impredicative type theory.

Game Semantics and Logical Games

Development of game-theoretic semantics for logics and programming languages with applications to cut elimination and normalization.

Sequent Calculus for Propositional Modal Logic

Development of complete sequent calculi for various modal logics with focus on structural properties and proof-theoretic analysis.

Epistemic Logic and Knowledge Operators

Study of knowledge and common knowledge with logical systems capturing epistemic and doxastic properties of rational agents.

Belief Revision Theory and AGM Postulates

Investigation of formal frameworks for modeling how agents rationally update beliefs in response to new information.

Graded Modal Logics and Counting Quantifiers

Study of modal logics with graded modalities and counting quantifiers with applications to description logics and knowledge representation.

Coalition Logic and Strategic Reasoning

Research on logics for reasoning about coalitional abilities and strategic interactions in multi-agent systems.

Alternating-Time Temporal Logic Extensions

Study of alternating-time temporal logic variants for specifying and verifying properties of game-like multi-agent systems.

Separation Logic Beyond Pointers

Investigation of separation logic applications beyond low-level heap reasoning to high-level concurrent program verification.

Concurrent Separation Logic and Atomicity

Research on extending separation logic to concurrent settings with reasoning about shared resources and atomic operations.

Dependent Type Theory and Metaprogramming

Study of metaprogramming capabilities in dependent type systems including reflection, staging, and proof automation.

Universe Levels and Hierarchy in Type Theory

Investigation of universe polymorphism and cumulative hierarchies in type theory to avoid paradox while maintaining expressiveness.

Univalence Axiom and Homotopical Equivalence

Study of the univalence axiom and its implications for treating equivalent structures as identical in type theory.

Synthetic Homotopy Theory in Type Theory

Development of homotopy-theoretic constructions and theorems directly within type theory using higher inductive types.

Propositional Truncation and Set-Level Reasoning

Study of propositional truncation in homotopy type theory enabling set-level mathematics without full homotopy information.

Two-Level Type Theory and Fibrations

Research on two-level type theories combining distinct type universes with fibrant and non-fibrant types.

Agda and Proof Assistant Foundations

Study of design principles and logical foundations underlying dependently-typed proof assistants and their type systems.

Coq Libraries and Formal Verification

Research on large-scale formalization in proof assistants with focus on certified algorithms and mathematical libraries.

Lean Mathlib and Mathematical Formalization

Investigation of systematic mathematical library development in Lean and community-driven formalization of pure mathematics.

Proof Complexity and Lower Bounds

Study of proof length and complexity in propositional proof systems with applications to SAT solving and computational hardness.

Bounded Arithmetic and Feasible Mathematics

Research on subsystems of arithmetic with polynomial-time bounded resources capturing feasible computation.

Complexity Classes and Logical Characterizations

Investigation of logical characterizations of computational complexity classes using descriptive complexity theory.

Automata and Regular Languages Extensions

Study of automata theory variants including weighted automata, register automata, and extensions to infinite structures.

Omega-Regular Languages and Büchi Automata

Research on languages of infinite words and automata characterizations with applications to reactive system specification.

Tree Automata and XML Processing

Study of tree automata and tree languages with applications to schema validation and automated XML processing.

Ehrenfeucht-Fraïssé Games and Expressiveness

Investigation of back-and-forth game methods for characterizing expressiveness and non-definability in logical systems.

VC Dimension and Shattering in Logic

Research on Vapnik-Chervonenkis dimension and related combinatorial properties in descriptive complexity and learning theory.

Constraint Satisfaction Problems and Logic

Study of logical foundations for CSP including Datalog-based approaches and connections to finite model theory.

Finite Model Theory and Resource Logics

Investigation of logics with restricted resources capturing exactly tractable queries and database-relevant properties.

Dialectica Interpretation and Functional Interpretations

Investigates functional interpretations of classical and intuitionistic theories through Gödel''s Dialectica method and its modern extensions.

Realizability Theory and Effective Computability

Studies realizability semantics as a bridge between constructive logic and computability, analyzing when propositions have effective witnesses.

Substructural Type Systems and Linear Resources

Develops type systems incorporating resource awareness through substructural logics, with applications to memory management and concurrent computation.

Categorical Proof Theory and Coherence

Examines proof-theoretic properties of categorical structures, investigating coherence conditions for functorial interpretations of logical derivations.

Constructive Analysis and Bishop Spaces

Develops rigorous constructive foundations for real analysis and topology using Bishop''s pointfree approach and formal topology.

Predicative Systems and Ramified Hierarchy

Analyzes predicative foundations avoiding impredicative comprehension, studying type hierarchies and their proof-theoretic strength boundaries.

Second-Order Arithmetic and Subsystems

Investigates subsystems of second-order arithmetic, their model-theoretic properties, and relationships to reverse mathematics classifications.

Transfinite Induction and Recursive Definitions

Studies principles of transfinite induction, well-founded recursion, and their computational interpretations in foundational frameworks.

Gödel Numbering and Self-Referential Phenomena

Analyzes mechanisms of self-reference through Gödel numbering, diagonal arguments, and their applications to unprovability results.

Cut Elimination and Normalization Proofs

Investigates cut elimination for various logical systems and term rewriting perspectives, establishing consistency and computational properties.

Splittings and Amalgamation in Model Theory

Studies amalgamation properties and splitting types in model-theoretic frameworks, characterizing structural constraints on definable sets.

Pcf Theory and Singular Cardinals

Develops possible cofinality theory for uncountable cardinals, analyzing cardinal exponentiation and singular cardinal arithmetic.

Descriptive Complexity and Finite Model Theory

Connects logical definability to computational complexity classes, establishing correspondences between languages and complexity hierarchies.

Game Semantics and Interactive Proofs

Develops game-theoretic semantics for logical systems, connecting games to proof structures and interactive computation models.

Infinitary Proof Systems and Logical Closure

Analyzes proof systems allowing infinite derivations, establishing proof-theoretic measures and closure properties of infinitary deduction.

Stratified Set Theory and Quine Systems

Investigates stratified axiomatizations of set theory avoiding paradoxes, exploring alternative foundational frameworks and their expressiveness.

Nonstandard Models and Transfer Principles

Studies nonstandard interpretations of arithmetic and analysis, analyzing transfer theorems and hyperreal extensions of classical structures.

Herbrand''s Theorem and Skolem Functions

Analyzes Herbrand''s fundamental theorem on witness extraction, connecting first-order logic to finite combinatorial problems.

Gentzen-Style Systems and Sequent Calculi

Develops and extends Gentzen''s framework for logical deduction, studying substructural variations and proof-theoretic properties.

Fixpoint Logics and Iteration

Studies logics extended with fixpoint operators, analyzing expressiveness, model-checking algorithms, and connections to recursive definitions.

Circularity and Grounded Theories

Investigates circular definitions and self-referential theories, developing groundedness conditions for consistent handling of interdependent definitions.

Structural Proof Theory and Modular Analysis

Applies structural techniques to analyze logical systems modularly, establishing invariants and transformations for proof-theoretic investigation.

Dependent Type Theory and Universes

Develops universe hierarchies in dependent type systems, analyzing impredicativity, polymorphism, and consistency of cumulative structures.

Abstract Interpretation and Program Verification

Applies logical foundations to abstract interpretation frameworks, connecting semantic approximation to program analysis and verification.

Topos Theory and Logical Frameworks

Explores topos-theoretic interpretations of logic, developing internal languages and logical structures within categorical foundations.

Recursive Ordinals and Ordinal Notations

Investigates recursive representations of ordinals, analyzing Bachmann-Howard ordinals and notational systems for proof-theoretic strength measurement.

Epsilon Numbers and Transfinite Arithmetic

Studies epsilon numbers and transfinite arithmetic operations, establishing algebraic properties and ordinal calculations for foundational systems.

Impredicativity and Circularity in Foundations

Analyzes impredicative definitions and circular reasoning in foundational frameworks, developing principled approaches to handling self-reference.

Inductive Definitions and Wellfounded Recursion

Investigates formal properties of inductive definitions, studying least and greatest fixpoints, and connections to coinduction.

Logical Strength and Consistency Hierarchies

Establishes hierarchies of logical systems by proof-theoretic strength, measuring consistency power through ordinal analysis and recursive principles.

Free Logic and Existence Assumptions

Develops logical systems without standard existence assumptions, analyzing quantification over possibly nonexistent objects and partial functions.

Subfunction Logic and Partial Application

Studies logics for partial functions and partial information, developing proof systems handling undefined values and incomplete specifications.

Nominal Logic and Fresh Names

Investigates nominal sets and nominal logic for handling names and binding, with applications to syntax with variable binding and alpha-equivalence.

Heyting Arithmetic and Intuitionistic Number Theory

Studies intuitionistic foundations of arithmetic, analyzing Heyting arithmetic and constructive number-theoretic principles through realizability.

Classical Realizability and Truth Values

Develops realizability interpretations for classical logic, analyzing duality between proofs and counterexamples in classical frameworks.

Kripke Semantics and Modal Completeness

Investigates Kripke''s semantics for modal and intuitionistic logics, establishing completeness results and correspondence theory between axioms and frames.

Institutional Logics and Logic Frameworks

Develops abstract institutional frameworks for uniform treatment of diverse logical systems, establishing meta-theoretical properties at the institutional level.

Logical Frameworks and Metalogical Reasoning

Constructs frameworks for formalizing metatheory of object logics, analyzing logical frameworks like LF for representing derivations and properties.

Bidirectional Type Checking and Synthesis

Develops bidirectional type systems combining checking and inference, establishing theoretical foundations for practical implementation of type algorithms.

Gradual Type Theory and Partial Typing

Studies type systems allowing mixture of typed and untyped code, analyzing migration between static and dynamic typing paradigms.

Session Types and Linear Communication

Develops type theories for structured communication protocols using linear types, ensuring deadlock freedom and protocol compliance in concurrent systems.

Existential Types and Type Abstraction

Investigates existential quantification over types, analyzing data abstraction, modules, and information hiding through existential type mechanisms.

Polymorphic Type Systems and Parametricity

Studies parametric polymorphism and relational parametricity theory, establishing abstraction theorems for polymorphic functions and representations.

Gradedness and Strict Positivity Conditions

Analyzes syntactic constraints on recursive definitions, studying strict positivity, guardedness, and staged computation for ensuring termination.

Observational Equivalence and Program Equivalence

Investigates observational equivalence relations for programs, establishing coinductive proof principles and logical relations for proving equivalences.

Continuation Passing Style and Control

Studies continuation-based semantics and control operators, connecting control delimiters to logical systems with multiple conclusions.

Separation Logic and Heap Reasoning

Develops logical systems for reasoning about mutable state and heap manipulation, establishing compositionality through separation conjunction.

Type Theory for Concurrent Programs

Constructs type systems capturing concurrency properties, analyzing race conditions, atomicity, and synchronization through refined type disciplines.

Internalizing Metatheory in Type Theory

Develops techniques for formalizing metatheoretic results within type-theoretic systems, studying reflection and internalization principles.

Structural Proof Theory and Sequent Systems

Investigation of proof-theoretic properties of sequent calculi, including cut elimination, structural rules, and their role in characterizing logical systems and establishing proof-theoretic ordinals.

Structural Proof Theory and Cut Elimination

Investigation of proof-theoretic properties including cut elimination, normalization procedures, and structural rules in formal logical systems to establish foundational principles of logical validity and computational significance.