New York Logic

|Logic talks and events in New York

Menu

Skip to content
  • Home
  • About
  • Calendar
  • Seminars
    • CUNY Logic Workshop
    • Set theory seminar
    • Model theory seminar
    • Models of PA seminar
    • Computational Logic Seminar
    • NY Philosophical Logic Group
    • Homotopy type theory reading group
    • Logic and Games Seminar
  • Speakers
  • Conferences
    • Set Theory Day
    • MAMLS
    • New England Recursion & Definability Seminar
    • NY Graduate Student Logic Conference
    • Simplicity Conference
  • New York Logic Blog

NEXP-completeness and Universal Hardness Results for Justification Logic

March 25, 2015
This entry was posted on March 25, 2015.

Welcome new speakers

Dan Turetsky
Notre Dame University

Upcoming talks

Recent Posts

  • NYLOGIC.ORG NOT WORKING RIGHT: LINK TO TEMPORARY WEB PAGE
  • Rohit Parikh 80th Birthday Conference
  • No seminars on Nov. 25
  • Northeast Regional Model Theory Days
  • No CUNY Logic Workshop on October 21

Topics

algebraic geometry algorithmic randomness Berkeley Boolean algebras Chicago commutative algebra Complexity computability computable model theory CUNY definability descriptive set theory Diamond differential algebra Epistemic Game Theory epistemic logic field theory forcing Graduate Center group theory HOD indestructibility infinite chess justification logic large cardinals Lattices of elementary substructures modal logic Models of PA model theory New York nonstandard analysis nonstandard models Notre Dame University Peano arithmetic philosophical logic philosophy philosophy of mathematics philosophy of set theory proof theory Ramsey theory reverse mathematics set-theoretic geology set theory UConn VC-dimension

Meta

  • Register
  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org