The following pages link to Grigori Mints (Q454365):
Displaying 50 items.
- An extension of the omega-rule (Q283132) (← links)
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- Modal logics of Stone spaces (Q438813) (← links)
- A constructive analysis of learning in Peano arithmetic (Q450942) (← links)
- Effective cut-elimination for a fragment of modal mu-calculus (Q454366) (← links)
- The second incompleteness theorem and bounded interpretations (Q454368) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- Choice and well-ordering (Q579255) (← links)
- Maslov's inverse method and decidable classes (Q583187) (← links)
- (Q587083) (redirect page) (← links)
- (Q591984) (redirect page) (← links)
- Methods of cut-elimination (Q609451) (← links)
- Preface to the special issue dedicated to Nikolai Alexandrovich Shanin on the occasion of his 90th birthday (Q638481) (← links)
- Cut-free formulations for a quantified logic of here and there (Q638492) (← links)
- Automated theorem provers: a practical tool for the working mathematician? (Q657585) (← links)
- Proof analysis in intermediate logics (Q661286) (← links)
- Induction in linear logic (Q674992) (← links)
- On the unity of logic (Q685059) (← links)
- The analytical completeness of Dzhaparidze's polymodal logics (Q685073) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- Dynamic topological logic (Q705534) (← links)
- Completeness of S4 with respect to the real line: revisited (Q705542) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Extension without cut (Q714731) (← links)
- CERES in higher-order logic (Q716500) (← links)
- Constructive modal logics. I (Q750417) (← links)
- Decidable and enumerable predicate logics of provability (Q750418) (← links)
- Method of invariant transformations and logical deduction (Q759745) (← links)
- Dynamic topological logic interpreted over minimal systems (Q766293) (← links)
- The modal logic of provability: cut-elimination (Q790809) (← links)
- A method of modeling a classical second stage arithmetic (Q793020) (← links)
- On some proof theoretical properties of the modal logic GL (Q798649) (← links)
- The predicate modal logic of provability (Q800346) (← links)
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- The absence and the presence of fixed point combinators (Q807612) (← links)
- Simple consequence relations (Q809992) (← links)
- The constructive Hilbert program and the limits of Martin-Löf type theory (Q813417) (← links)
- Cut elimination for S4C: A case study (Q817705) (← links)
- Multimodal logics of products of topologies (Q861569) (← links)
- Variable declarations in natural deduction (Q861825) (← links)
- The modal logic of continuous functions on Cantor space (Q862352) (← links)
- Bounded functional interpretation and feasible analysis (Q866559) (← links)
- Complexity of admissible rules (Q868660) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Truth table logic, with a survey of embeddability results (Q912092) (← links)
- The completeness of provable realizability (Q916636) (← links)
- A framework for measuring the complexity of mathematical concepts (Q920074) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
