Egor Ianovski
Interests
My interest mainly lies in the two fields of logic and game theory. The link from reasoning, to argument, to strategy is a natural one, and no study of agency is complete without embracing both subjects.
Biography
I hold a BA in Economics and a BSc (Hons) in Logic and Computation from the University of Auckland (2007-2011), the latter under the supervision of Mark Wilson.
In 2012 I completed an MSc in Logic and Computation at the University of Auckland under the supervision of André Nies.
See also
- ES1S(\in,s) is co-Buchi
- EGN for Boolean games
- Complexity of eq. rels
- Master's thesis
- Honours' dissertation
Selected Publications
-
COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
EGOR IANOVSKI‚ RUSSELL MILLER‚ KENG MENG NG and ANDRÉ NIES
In The Journal of Symbolic Logic. Vol. 79. Pages 859–881. September, 2014.
Details about COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | BibTeX data for COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | DOI (10.1017/jsl.2013.33) | Link to COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
-
∃GuaranteeNash for Boolean games is NEXP−hard
Egor Ianovski and Luke Ong
In 14th International Conference on Principles of Knowledge Representation and Reasoning. 2014.
Details about ∃GuaranteeNash for Boolean games is NEXP−hard | BibTeX data for ∃GuaranteeNash for Boolean games is NEXP−hard
-
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
Alwen Tiu‚ Egor Ianovski and Rajeev Goré
In Advances in Modal Logic. Pages 516−537. 2012.
Details about Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures | BibTeX data for Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures