<style face="normal" font="default" size="100%">Applicative theories for logarithmic complexity classes</style>

Drupal-Biblio

34

<style face="normal" font="default" size="100%">Applicative theories for logarithmic complexity classes</style>

Drupal-Biblio

34

<style face="normal" font="default" size="100%">A feasible theory of truth over combinatory logic</style>

Drupal-Biblio

34

<style face="normal" font="default" size="100%">Full and Hat Inductive Definitions Are Equivalent in NBG</style>

Drupal-Biblio

34

<style face="normal" font="default" size="100%">Relative Predicativity and Dependent Recursion in Second-order Set Theory and Higher-order Theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Canonical proof nets for classical logic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Decidability for Justification Logics Revisited</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Operational closure and stability</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Proof nets for Herbrand's Theorem</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Realizing Public Announcements by Justifications</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Unfolding feasible arithmetic and weak truth</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A Universal Approach to Guarantee Data Privacy</style>

Drupal-Biblio

5

<style face="normal" font="default" size="100%">Decidability for Justification Logics Revisited</style>

Drupal-Biblio

5

<style face="normal" font="default" size="100%">Update as Evidence: Belief Expansion</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">About the Strength of Operational Regularity</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Cut-elimination for the mu-calculus with one variable</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Java-Programm zur interaktiven Bearbeitung von JALC-Herleitungen</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Justification Logics with Common Knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Justifications, Ontology, and Conservativity</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Justified Terminological Reasoning</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Lower complexity bounds in justification logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Product-free Lambek calculus is NP-complete</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">On the Realization and Classification of Justification Logics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Realization for Justification Logics via Nested Sequents: Modularity through Embedding</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Syntactic cut-elimination for a fragment of the modal mu-calculus</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Weak theories of truth and explicit mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Admissible closures of polynomial time computable arithmetic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">An application of justification logic to protocol verification</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Applicative theories on tree ordinal numbers</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A Buchholz rule for modal fixed point logics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Justification Logic, Inference Tracking, and Data Privacy</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Justifications for Common Knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Partial Realization in Dynamic Justification Logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The provably terminating operations of the subsystem PETJ of explicit mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Realizability in weak systems of explicit mathematics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">On the Relationship between Choice Schemes and Iterated Class Comprehension in Set Theory</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Annotated Systems for Common Knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Expansion nets: Proof nets for for propositional classical logic</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Explicit Evidence Systems with Common Knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Justified Belief Change</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Modal Fixed Point Logics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Nested Sequents</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Privacy Preserving Modules for Ontologies</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-theoretic aspects of weak König's Lemma</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-Theoretic Contributions to Modal Fixed Point Logics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Self-Referential Justifications in Epistemic Logic</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Self-Referentiality in Contraction-free Fragments of Modal Logic S4</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A Syntactic Realization Theorem for Justification Logics</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Two Ways to Common Knowledge</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Unfolding finitist arithmetic</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Verification of Workflow Control-Flow Patterns with the SPIN Model Checker</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Weak theories of operations and types</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">$Σ^1_1$ choice in a theory of sets and classes</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Aspekte beweisbar totaler Funktionen in applikativen Theorien</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Belief Change Functions for Multi-Agent Systems</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Common knowledge does not have the Beth property</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Data Privacy for ALC Knowledge Bases</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Deciding Data Privacy for ALC Knowledge Bases</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Deep Sequent Systems for Modal Logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Elementary explicit types and polynomial time operations</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Full operational set theory with unbounded existential quantification and power set</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Justifying induction on modal mu-formulae</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Logical Omniscience as a Computational Complexity Problem</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On modal $μ$-calculus and Gödel-Löb logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The modal $μ$-calculus hierarchy over restricted classes of transition systems</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Modular Sequent Systems for Modal Logic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A Note on the Use of Sum in the Logic of Proofs</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">The NP-completeness of reflected fragments of justification logics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Ontological Questions about Operational Set Theory</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Operations, sets and classes</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-Systems for PLTL: Cycling Sequents and their Use in a Finitization for PLTL</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Sequent calculi for the modal $μ$-calculus over $\mathsf {S5}$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Syntactic cut-elimination for common knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Syntactic cut-elimination for common knowledge</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Weak Systems of Explicit Mathematics</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">An Algorithmic Interpretation of a Deep Inference System</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Automatic Model Checking of UML models</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">The Basic Feasible Functionals in Bounded Arithmetic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Canonical completeness of infinitary mu</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On contraction and the modal fragment</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Cut-free sequent systems for temporal logic</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Explicit Mathematics with Positive Existential Stratified Comprehension, Join and Uniform Monotone Inductive Definitions</style>

Drupal-Biblio

6

<style face="normal" font="default" size="100%">Gödel's Dialectica Interpretation</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Introduction</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Polytime Functions in Two-Sorted Bounded Arithmetic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Primitive recursive selection functions for existential assertions over abstract algebras</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On the proof theory of the modal mu-calculus</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Soft linear set theory</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Computing with common knowledge</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Cut-free common knowledge</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A deep inference system for the modal logic $\mathsf S5$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On Feferman's operational set theory $\mathsf OST$</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A formal model of data privacy</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Improving semantic query answering</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Merging rule-based belief databases</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">A syntactical treatment of simultaneous fixpoints in the modal $μ$-calculus</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Total public announcements</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Cut elimination inside a deep inference system for classical predicate logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Deduction chains for common knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Deep inference and its normal form of derivations</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Deep sequent systems for modal logic</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Description Logic Query Answering with Relational Databases</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Explicit Mathematics with Positive Existential Comprehension and Join</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A hybrid representation of knowledge and belief</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Locality for classical logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On the proof theory of type two functionals based on primitive recursive operations</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The proof-theoretic analysis of transfinitely iterated quasi least fixed points</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-Theoretic Aspects of Modal Logic with Fixed Points</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Revising non-monotonic rule-based belief databases</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A system for consistency preserving belief change</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">About cut elimination for logics of common knowledge</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">ALOE – A Graphical Editor for OWL Ontologies</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">On the Consistency Strength of the Strict $\Pi^1_1$ Reflection Principle</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Cut-free axiomatizations for stratified modal fixed point logic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Elementary Arithmetic</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Explicit mathematics: power types and overloading</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">$\mathcal{PALC}$: Extending $\mathcal{ALC}$ ABoxes with Probabilities</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">$\mathsf{PLTL}$ – Vollständigkeit und Modell-Konstruktion</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Metapredicative and explicit Mahlo: a proof-theoretic perspective</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Probabilistic ABox reasoning: preliminary results</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Provable data privacy</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Pseudo-Hierarchies in Admissible Set Theory without Foundation and Explicit Mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Reflections on reflections in explicit mathematics</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Relational representation of $\mathcal{ALN}$ knowledge bases</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On the relationship between fixed points and iteration in admissible set theory without foundation</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">On two forms of bureaucracy in derivations</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Wellordering Two Sorts: A Slow-Growing Proof Theory for Variable Separation</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">An intensional fixed point theory over first order arithmetic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Iterating $Σ$ operations in admissible set theory without foundation: a further aspect of metapredicative Mahlo</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">On modal $μ$-calculus and non-well-founded set theory</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A proof-theoretic characterization of the basic feasible functionals</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Variation on a theme of Schütte</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Weak König's Lemma and Extensional Equality</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The proof-theoretic analysis of $Σ^1_1$ transfinite dependent choice</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Theories with self-application and computational complexity</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Two Interpretations of $\mathsf{WKL}_0$ in Subsystems of $\mathsf{PA}$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Universes in metapredicative analysis</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Extending the system $\mathsf{T}_0$ of explicit mathematics: the limit and Mahlo axioms</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Information Flow – Logics for the (R)age of Information</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Intuitionistic fixed point theories for strictly positive operators</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">The Modal $μ$-Calculus and the Logic of Common Knowledge</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Proof theoretic complexity</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">The proof-theoretic analysis of the Suslin operator in applicative theories</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Strictness of the modal $μ$-calculus hierarchy</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Transfinite dependent choice and $\omega$-model reflection</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">On the Treatment of Predicative Polymorphism in Theories of Explicit Mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Wellordering proofs for metapredicative Mahlo</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Constructive foundations for Featherweight Java</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Formalizing non-termination of recursive programs</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">How to normalize the Jay</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">The MacLWB and the Logic of Likelihood</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Object-Oriented Programming in Explicit Mathematics: Towards the Mathematics of Objects</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-theoretic contributions to explicit mathematics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Proof-Theoretic Strength of $\mathsf{PRON}$ with Various Extensions</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Realization of analysis into explicit mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A semantics for $\lambda^{\{\}}_{\mathsf str}$: a calculus with overloading and late-binding</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Theories of Ordinal Strength $\varphi 2 0$ and $\varphi 2 \varepsilon_0$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Universes in explicit mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Autonomous fixed point progressions and fixed point transfinite recursion</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A benchmark method for the propositional modal logics K, KT, S4</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Einige Aspekte der Modallogik $\mathsf{S5}_n$ mit Allgemeinwissen</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Finitary reductions for local predicativity, I: recursively regular ordinals</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Fixed point theories and dependent choice</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Metapredicative Subsystems of Analysis</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The non-constructive $μ$-operator, fixed point theories with ordinals, and the bar rule</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">N-strictness in applicative theories</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A theory of explicit mathematics equivalent to ${ \mathsf{ID} }_1$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The unfolding of non-finitist arithmetic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">On applicative theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Bar induction and $\omega$ model reflection</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Characterizing the Grzegorczyk hierarchy by safe recursion</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Charakterisierungen kleiner Komplexitätsklassen mittels geschichteter N-Prädikate</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Dependent Choice in Explicit Mathematics</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Extension of the Modal System KT4</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">First steps into metapredicativity in explicit mathematics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Konstruktion von Gegenmodellen intuitionistisch unbeweisbarer Sequenzen</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Logics Workbench für Window System</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The proof-theoretic analysis of transfinitely iterated fixed point theories</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">A semantics for $\lambda^{ \{ \} }_{ \mathsf {str }}$: a calculus with overloading and late-binding</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Aspects of Computational Logic</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Comparison of Theorem Provers for Modal Logics – Introduction and Summary</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Frege structures for partial applicative theories</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Logics Workbench 1.0</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A new one-pass tableau calculus for $\mathsf{PLTL}$</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A proof-theoretic framework for logic programming</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Relation Algebra and Modal Logics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Sequent Calculi for Proof Search in some Modal Logics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The $μ$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Applikative Theorien und Frege-Strukturen</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Explicit Mathematics: W-type, Models</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Hybrid spectral transform diagrams</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Hybrid spectral transform diagrams</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Modal rule correspondences</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Model checking</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Polynomial time operations in explicit mathematics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Power types in explicit mathematics?</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Relations between propositional normal modal logics: an overview</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Some proof theory of first order logic programming</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Uniform limit in explicit mathematics with universes</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">A benchmark method for the propositional modal logics K, KT, S4</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Efficient loop-check for backward proof search in some non-classical propositional logics</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Frege structures for partial applicative theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">A logics workbench</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The logics workbench LWB: a snapshot</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">LWBtheory: information about some propositional logics via the WWW</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">On the modal logic K plus theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Partial applicative theories and explicit substitutions</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">On the Proof Theory of Applicative Theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Some theories with positive induction of ordinal strength $\varphi \omega 0$</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Systems of explicit mathematics with non-constructive $μ$-operator and join</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Systems of explicit mathematics with non-constructive $μ$-operator. Part II</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Universes over Frege Structures</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">A deductive approach to logic programming</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">LWB - a logics workbench, extended abstract</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Natural numbers and forms of weak induction in applicative theories</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Propositional logics on the computer</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Relational semantics for modal logics</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Second order theories with ordinals and elementary comprehension</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Totality in applicative theories</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">About some symmetries of negation</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">The basic logic of proofs</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Executable models for analysis and implementation of complex systems</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">The Basic Logic of Proofs</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">The defining power of stratified and hierarchical logic programs</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Fixed points in Peano arithmetic with ordinals</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">Functionality in the Basic Logic of Proofs</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">The Logic of the {Gödel Proof Predicate</style>

Drupal-Biblio

47

<style face="normal" font="default" size="100%">Some proof-theoretic aspects of logic programming</style>

Drupal-Biblio

17

<style face="normal" font="default" size="100%">Systems of explicit mathematics with non-constructive $μ$-operator. Part I</style>

Drupal-Biblio

13

<style face="normal" font="default" size="100%">The Basic Logic of Proofs</style>