Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
Labelled Modal Logics: Quantifiers
Journal of Logic, Language and Information
Conservation and uniform normalization in Lambda calculi with erasing reductions
Information and Computation
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
A Local System for Classical Logic
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Strong Normalisation of Cut-Elimination in Classical Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Modal Formulation of McCain and Turner's Theory of Causal Reasoning
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Labelled Deduction over Algebras of Truth-Values
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Implementation of Proof Search in the Imperative Programming Language Pizza
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
From Kripke Models to Algebraic Counter-Valuations
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Tableaux Calculus for Ambiguous Quantification
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Formal Framework for Synthesis and Verification of Logic Programs
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Cut-Free Display Calculi for Nominal Tense Logics
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
CL '00 Proceedings of the First International Conference on Computational Logic
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Deriving Modular Programs from Short Proofs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Labelled Natural Deduction for Interval Logics
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Connections in nonclassical logics
Handbook of automated reasoning
Two Natural Deduction Systems for Hybrid Logic: A Comparison
Journal of Logic, Language and Information
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Analytic calculi for monoidal t-norm based logic
Fundamenta Informaticae
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Natural Deduction for First-Order Hybrid Logic
Journal of Logic, Language and Information
On the complexity of the disjunction property in intuitionistic and modal logics
ACM Transactions on Computational Logic (TOCL)
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
A complexity analysis of functional interpretations
Theoretical Computer Science
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Resource operators for λ-calculus
Information and Computation
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
A duality between proof systems for cyclic term graphs
Mathematical Structures in Computer Science
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Imperative LF Meta-Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Labelled Calculi for Łukasiewicz Logics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Theoretical Computer Science
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
A solver for QBFs in negation normal form
Constraints
A Labeled Natural Deduction System for a Fragment of CTL*
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Common knowledge does not have the Beth property
Information Processing Letters
Journal of Functional Programming
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Validated Proof-Producing Decision Procedures
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural Deduction for Full S5 Modal Logic with Weak Normalization
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical Program Extraction from Classical Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Automated Reasoning
A wistech paradigm for intelligent systems
Transactions on rough sets VI
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Abstract deduction and inferential models for type theory
Information and Computation
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Reasoning Processes in Propositional Logic
Journal of Logic, Language and Information
A Sequent Calculus for a Negative Free Logic
Studia Logica
How to universally close the existential rule
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Label-free proof systems for intuitionistic modal logic IS5
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Specifying Proof Systems in Linear Logic with Subexponentials
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
Kripke semantics for basic sequent systems
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
On the proof complexity of cut-free bounded deep inference
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
A hypersequent system for gödel-dummett logic with non-constant domains
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Sequent calculi and decidability for intuitionistic hybrid logic
Information and Computation
Proof theory of Nelson's paraconsistent logic: A uniform perspective
Theoretical Computer Science
A local system for intuitionistic logic
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LJQ: a strongly focused calculus for intuitionistic logic
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
On interpolation in existence logics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Semantic cut elimination in the intuitionistic sequent calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Using proofs by coinduction to find “traditional” proofs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Applying tree languages in proof theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Natural Deduction for Dual-intuitionistic Logic
Studia Logica
Stratification in logics of definitions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Complexity of deep inference via atomic flows
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Analytic Calculi for Monoidal T-norm Based Logic
Fundamenta Informaticae
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Multi Lingual Sequent Calculus and Coherent Spaces
Fundamenta Informaticae
Automatic derivation of compositional rules in automated compositional reasoning
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Proof Nets for Herbrand’s Theorem
ACM Transactions on Computational Logic (TOCL)
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
Coalgebraic predicate logic: equipollence results and proof theory
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
A unified semantic framework for fully structural propositional sequent systems
ACM Transactions on Computational Logic (TOCL)
A short proof of Glivenko theorems for intermediate predicate logics
Archive for Mathematical Logic
| Hi-index | 0.00 |