Author:
Litak Tadeusz,Visser Albert
Reference144 articles.
1. A formalized proof of strong normalization for guarded recursive types;Abel,2014
2. Computational interpretations of linear logic;Abramsky;Theoret. Comput. Sci.,1993
3. Cut-free tableau calculi for some propositional normal modal logics;Amerbauer;Studia Logica,1996
4. A.W. Appel, P.-A. Melliès, C.D. Richards, J. Vouillon, A very modal model of a modern, major, general type system, in: Proceedings of POPL. ACM SIGPLAN-SIGACT, 2007, pp. 109–122.
5. M. Ardeshir, S. Mojtahedi, The Σ1-provability logic of HA, 2014. arXiv preprint arXiv:1409.5699.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The G4i Analogue of a G3i Sequent Calculus;Studia Logica;2022-07-15
2. Monotone Subintuitionistic Logic: Duality and Transfer Results;Notre Dame Journal of Formal Logic;2022-05-01
3. Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
4. Negation as a modality in a quantified setting;Journal of Logic and Computation;2021-04-05
5. Implication via Spacetime;Logic, Epistemology, and the Unity of Science;2021