On the public citation graph
Hypersequents, logical consequence and intermediate logics for concurrency
0 signed · 181 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19710170126openalex-snapshot
Algebraic Completeness Results for Dummett's LC and Its Extensions
inferredcites →https://doi.org/10.1007/978-3-642-87374-4_12openalex-snapshot
Deduction and Computation
inferredcites →https://doi.org/10.1007/978-3-662-40145-3_2openalex-snapshot
Deduction and Computation
inferredcites →https://doi.org/10.1016/0003-4843(74)90010-2openalex-snapshot
The correspondence between cut-elimination and normalization
inferredcites →https://doi.org/10.1016/0003-4843(74)90011-4openalex-snapshot
The correspondence between cut-elimination and normalization II
inferredcites →https://doi.org/10.1016/0003-4843(82)90024-9openalex-snapshot
On the completenes principle: A study of provability in heyting's arithmetic and extensions
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(88)90037-0openalex-snapshot
The semantics and proof theory of linear logic
inferredcites →https://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations
inferredcites →https://doi.org/10.1017/s0022481200125848openalex-snapshot
Notice 1960 International Congress for Logic, Methodology and Philosophy of Science
inferredcites →https://doi.org/10.1305/ndjfl/1093636612openalex-snapshot
On an implication connective of ${\rm RM}$.
inferredcites →https://doi.org/10.2307/2964753openalex-snapshot
A propositional calculus with denumerable matrix
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722086_11openalex-snapshot
A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus
inferred← citeshttps://doi.org/10.1007/10722086_12openalex-snapshot
An Analytic Calculus for Quantified Propositional Gödel Logic
inferred← citeshttps://doi.org/10.1007/10722086_15openalex-snapshot
Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics
inferred← citeshttps://doi.org/10.1007/11916277_17openalex-snapshot
A Local System for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_12openalex-snapshot
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_3openalex-snapshot
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_9openalex-snapshot
Tableau Calculi for the Logics of Finite k-Ary Trees
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_14openalex-snapshot
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_20openalex-snapshot
On the Undecidability of Some Sub-classical First-Order Logics
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_13openalex-snapshot
Bounded Contraction in Systems with Linearity
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_8openalex-snapshot
Analytic Calculi for Projective Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_10openalex-snapshot
A Hypersequent Calculus with Clusters for Data Logic over Ordinals
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_6openalex-snapshot
Bounded Sequent Calculi for Non-classical Logics via Hypersequents
inferred← citeshttps://doi.org/10.1007/978-3-030-36755-8_11openalex-snapshot
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-3-030-50146-4_20openalex-snapshot
From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_1openalex-snapshot
Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_2openalex-snapshot
Interpretations of Weak Positive Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_10openalex-snapshot
Sequents vs Hypersequents for Åqvist Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_11openalex-snapshot
GL-Based Calculi for PCL and Its Deontic Cousin
inferred← citeshttps://doi.org/10.1007/978-3-319-10193-4_4openalex-snapshot
A Formal Framework for Hypersequent Calculi and Their Fibring
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_2openalex-snapshot
Tools for the Investigation of Substructural and Paraconsistent Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-28808-6_1openalex-snapshot
Fuzzy Logic and the Linz Seminar: Themes and Some Personal Reminiscences
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_38openalex-snapshot
Automated Generation of Analytic Calculi for Logics with Linearity
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_33openalex-snapshot
Uniform Rules and Dialogue Games for Fuzzy Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_7openalex-snapshot
Parallel Dialogue Games and Hypersequents for Intermediate Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_33openalex-snapshot
Goal-Directed Calculi for Gödel-Dummett Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_23openalex-snapshot
Hypersequent Calculus for Intuitionistic Logic with Classical Atoms
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_32openalex-snapshot
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-93802-6_11openalex-snapshot
Dialogue Games as Foundation of Fuzzy Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_20openalex-snapshot
Proof Systems for a Gödel Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_14openalex-snapshot
Expanding the Realm of Systematic Proof Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_36openalex-snapshot
A Multiple-Conclusion Calculus for First-Order Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_20openalex-snapshot
A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-23211-4_13openalex-snapshot
A Co-inductive Language and Truth Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_14openalex-snapshot
A Lambda Calculus for Gödel–Dummett Logic Capturing Waitfreedom
inferred← citeshttps://doi.org/10.1007/978-3-642-40948-6_10openalex-snapshot
Sequent Calculi for Multi-modal Logic with Interaction
inferred← citeshttps://doi.org/10.1007/978-3-642-54789-8_23openalex-snapshot
The Hidden Structural Rules of the Discontinuous Lambek Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_5openalex-snapshot
Choreographies, Logically
inferred← citeshttps://doi.org/10.1007/978-3-662-53042-9_9openalex-snapshot
Models for the Displacement Calculus
inferred← citeshttps://doi.org/10.1007/978-3-7908-1769-0_6openalex-snapshot
Sequent of Relations Calculi: A Framework for Analytic Deduction in Many-valued Logics
inferred← citeshttps://doi.org/10.1007/978-3-7908-1818-5_1openalex-snapshot
A Natural Deduction System for Intuitionistic Fuzzy Logic
inferred← citeshttps://doi.org/10.1007/978-90-481-9670-8_6openalex-snapshot
On the Tree-Hypersequent Calculi
inferred← citeshttps://doi.org/10.1007/978-94-007-0320-9_9openalex-snapshot
CERES in Nonclassical Logics
inferred← citeshttps://doi.org/10.1007/978-94-010-0387-2_2openalex-snapshot
Sequent Systems for Modal Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot
Advanced Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/978-981-19-8633-8_7openalex-snapshot
R-Calculi for Supersequents
inferred← citeshttps://doi.org/10.1007/bfb0055769openalex-snapshot
Proof theory of fuzzy logics: Urquhart's C and related logics
inferred← citeshttps://doi.org/10.1007/s00153-004-0225-3openalex-snapshot
Analytic Calculi for Product Logics
inferred← citeshttps://doi.org/10.1007/s00153-004-0265-8openalex-snapshot
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
inferred← citeshttps://doi.org/10.1007/s00153-007-0047-1openalex-snapshot
Fuzzy logics based on [0,1)-continuous uninorms
inferred← citeshttps://doi.org/10.1007/s00500-014-1265-1openalex-snapshot
A note on standard completeness for some extensions of uninorm logic
inferred← citeshttps://doi.org/10.1007/s005000050047openalex-snapshot
Cut-free proof systems for logics of weak excluded middle
inferred← citeshttps://doi.org/10.1007/s10670-020-00264-xopenalex-snapshot
A Hypersequent Solution to the Inferentialist Problem of Modality
inferred← citeshttps://doi.org/10.1007/s10817-010-9182-1openalex-snapshot
A Framework for Proof Systems
inferred← citeshttps://doi.org/10.1007/s10849-025-09437-9openalex-snapshot
Exception and typicality, logically framed
inferred← citeshttps://doi.org/10.1007/s11225-008-9143-4openalex-snapshot
Dialogue Games for Many-Valued Logics — an Overview
inferred← citeshttps://doi.org/10.1007/s11225-014-9566-zopenalex-snapshot
Hypersequent and Display Calculi – a Unified Perspective
inferred← citeshttps://doi.org/10.1007/s11225-020-09906-1openalex-snapshot
A Generalized Proof-Theoretic Approach to Logical Argumentation Based on Hypersequents
inferred← citeshttps://doi.org/10.1007/s11225-021-09966-xopenalex-snapshot
From Semantic Games to Provability: The Case of Gödel Logic
inferred← citeshttps://doi.org/10.1007/s11229-019-02226-5openalex-snapshot
An ecumenical notion of entailment
inferred← citeshttps://doi.org/10.1007/s11787-022-00300-0openalex-snapshot
From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50022-9openalex-snapshot
Automated Deduction for Many-Valued Logics
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50024-2openalex-snapshot
Connections in Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/b978-044451814-9/50010-0openalex-snapshot
Triangular norm-based mathematical fuzzy logics
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.013openalex-snapshot
Hypersequent calculi for intuitionistic logic with classical atoms
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.003openalex-snapshot
Algebraic proof theory for substructural logics: Cut-elimination and completions
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.012openalex-snapshot
Algebraic proof theory: Hypersequents and hypercompletions
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104236openalex-snapshot
Gödel–Dummett linear temporal logic
inferred← citeshttps://doi.org/10.1016/j.fss.2012.04.017openalex-snapshot
Uninorm logic with the -potency axiom
inferred← citeshttps://doi.org/10.1016/j.fss.2015.01.017openalex-snapshot
A cut-free calculus for second-order Gödel logic
inferred← citeshttps://doi.org/10.1016/j.ins.2010.06.004openalex-snapshot
Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.07.002openalex-snapshot
Eliminability of cut in hypersequent calculi for some modal logics of linear frames
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.014openalex-snapshot
Uniform proofs of standard completeness for extensions of first-order MTL
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.022openalex-snapshot
On the concurrent computational content of intermediate logics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00172-0openalex-snapshot
Hyperformulae, Parallel Deductions and Intersection Types
inferred← citeshttps://doi.org/10.1016/s1874-5857(07)80009-4openalex-snapshot
Fuzzy-Set Based Logics — an History-Oriented Presentation of their Main Developments
inferred← citeshttps://doi.org/10.1017/bsl.2016.2openalex-snapshot
LINEAR TIME IN HYPERSEQUENT FRAMEWORK
inferred← citeshttps://doi.org/10.1017/jsl.2021.42openalex-snapshot
BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
inferred← citeshttps://doi.org/10.1017/s1755020319000352openalex-snapshot
CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
inferred← citeshttps://doi.org/10.1017/s1755020321000411openalex-snapshot
FRACTIONAL-VALUED MODAL LOGIC
inferred← citeshttps://doi.org/10.1023/a:1013813806341openalex-snapshot
Decomposition Proof Systems for Gödel-Dummett Logics
inferred← citeshttps://doi.org/10.1023/a:1017515831550openalex-snapshot
An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic
inferred← citeshttps://doi.org/10.1080/11663081.2014.964490openalex-snapshot
Prior’s OIC nonconservativity example revisited
inferred← citeshttps://doi.org/10.1080/11663081.2023.2233346openalex-snapshot
Nested sequents for intermediate logics: the case of Gödel-Dummett logics
inferred← citeshttps://doi.org/10.1093/jigpal/6.5.695openalex-snapshot
Two types of multiple-conclusion systems
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf053openalex-snapshot
A note on cut-elimination for intuitionistic logic with actuality
inferred← citeshttps://doi.org/10.1093/jigpal/jzq046openalex-snapshot
On a conservative extension argument of Dana Scott
inferred← citeshttps://doi.org/10.1093/logcom/11.2.283openalex-snapshot
Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
inferred← citeshttps://doi.org/10.1093/logcom/13.6.835openalex-snapshot
Hypersequent Calculi for Godel Logics -- a Survey
inferred← citeshttps://doi.org/10.1093/logcom/exad048openalex-snapshot
Linear logic in a refutational setting
inferred← citeshttps://doi.org/10.1093/logcom/exm053openalex-snapshot
Analytic Calculi for Logics of Ordinal Multiples of Standard t-Norms
inferred← citeshttps://doi.org/10.1093/logcom/exp055openalex-snapshot
A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
inferred← citeshttps://doi.org/10.1093/logcom/exs006openalex-snapshot
A semantic proof of strong cut-admissibility for first-order Godel logic
inferred← citeshttps://doi.org/10.1093/logcom/exs057openalex-snapshot
Quantifiers in logic and proof-search using permissive-nominal terms and sets
inferred← citeshttps://doi.org/10.1093/logcom/ext018openalex-snapshot
Proof theory of witnessed Gödel logic: A negative result
inferred← citeshttps://doi.org/10.1093/logcom/ext029openalex-snapshot
Semantic investigation of canonical Gödel hypersequent systems
inferred← citeshttps://doi.org/10.1093/logcom/ext035openalex-snapshot
Falsification, natural deduction and bi-intuitionistic logic
inferred← citeshttps://doi.org/10.1093/logcom/exu061openalex-snapshot
Embedding the hypersequent calculus in the display calculus
inferred← citeshttps://doi.org/10.1093/logcom/exy019openalex-snapshot
Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning
inferred← citeshttps://doi.org/10.1109/csse.2008.1183openalex-snapshot
An Algorithm for Weak Disjunctive Normal Form Reduction in G3 Logic
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2017.8015625openalex-snapshot
Standard completeness for extensions of IMTL
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679315openalex-snapshot
Compact propositional Godel logics
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924570openalex-snapshot
Cut-elimination in a sequents-of-relations calculus for Godel logic
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924577openalex-snapshot
Hypersequents as a uniform framework for Urquhart's C, MTL and related logics
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201405openalex-snapshot
From intuitionistic logic to Godel-dummett logic via parallel dialogue games
inferred← citeshttps://doi.org/10.1109/ismvl.2006.16openalex-snapshot
Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta
inferred← citeshttps://doi.org/10.1109/ismvl.2007.33openalex-snapshot
Model-Characterizing Formulas and Normal Forms in Godel Logics
inferred← citeshttps://doi.org/10.1109/ismvl.2015.20openalex-snapshot
Standard Completeness for Uninorm-Based Logics
inferred← citeshttps://doi.org/10.1109/ismvl51352.2021.00021openalex-snapshot
Proof Systems for Gödel Logics with an Involution
inferred← citeshttps://doi.org/10.1109/ismvl68998.2026.00028openalex-snapshot
Notes on Proof Systems for Intermediate Logics
inferred← citeshttps://doi.org/10.1109/lics.2008.39openalex-snapshot
From Axioms to Analytic Rules in Nonclassical Logics
inferred← citeshttps://doi.org/10.1109/lics.2017.8005076openalex-snapshot
Gödel logic: From natural deduction to parallel computation
inferred← citeshttps://doi.org/10.1145/1071596.1071600openalex-snapshot
Sequent and hypersequent calculi for abelian and łukasiewicz logics
inferred← citeshttps://doi.org/10.1145/3290337openalex-snapshot
Better late than never: a fully-abstract semantics for classical processes
inferred← citeshttps://doi.org/10.1145/3371086openalex-snapshot
Par means parallel: multiplicative linear logic proofs as concurrent functional programs
inferred← citeshttps://doi.org/10.1145/3473567openalex-snapshot
Client-server sessions in linear logic
inferred← citeshttps://doi.org/10.1145/3498662openalex-snapshot
Connectivity graphs: a method for proving deadlock freedom based on separation logic
inferred← citeshttps://doi.org/10.1145/3547638openalex-snapshot
Multiparty GV: functional multiparty session types with certified deadlock freedom
inferred← citeshttps://doi.org/10.1145/3725849openalex-snapshot
Hypersequent Calculi for Propositional Default Logics
inferred← citeshttps://doi.org/10.1145/3844503openalex-snapshot
\(\pi\) LL: Reconciling Linear Logic, the \(\pi\) -calculus, and their Metatheory
inferred← citeshttps://doi.org/10.12775/llp.2015.018openalex-snapshot
Hypersequent Calculi for S5: The Methods of Cut Elimination
inferred← citeshttps://doi.org/10.13130/fiorentini-camillo_phd2000openalex-snapshot
Kripke completeness for intermediate logics
inferred← citeshttps://doi.org/10.18778/0138-0680.2023.17openalex-snapshot
Fractional-Valued Modal Logic and Soft Bilateralism
inferred← citeshttps://doi.org/10.18778/0138-0680.2023.30openalex-snapshot
Linear Abelian Modal Logic
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:13)2016openalex-snapshot
On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:10)2011openalex-snapshot
Towards a Proof Theory of G\"odel Modal Logics
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:20)2012openalex-snapshot
Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability
inferred← citeshttps://doi.org/10.2178/jsl/1174668382openalex-snapshot
Linear Kripke frames and Gödel logics
inferred← citeshttps://doi.org/10.29007/g15zopenalex-snapshot
A typed parallel lambda-calculus via 1-depth intermediate proofs
inferred← citeshttps://doi.org/10.29007/mbbqopenalex-snapshot
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus
inferred← citeshttps://doi.org/10.2991/eusflat.2011.87openalex-snapshot
Non-deterministic Connectives in Propositional Godel Logic
inferred← citeshttps://doi.org/10.3233/fi-2012-778openalex-snapshot
Intersection Types from a Proof-theoretic Perspective
inferred← citeshttps://doi.org/10.3233/fi-2018-1700openalex-snapshot
Multi-Agent Dialogues and Dialogue Sequents for Proof Search and Scheduling in Intuitionistic Logic and the Modal Logic S4
inferred← citeshttps://doi.org/10.3233/fun-2004-59401openalex-snapshot
Analytic Calculi for Monoidal T-norm Based Logic
inferred← citeshttps://doi.org/10.3390/sym11040445openalex-snapshot
A Proof of the Standard Completeness for the Involutive Uninorm Logic
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2018.15openalex-snapshot
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:3)2023openalex-snapshot
Separating Sessions Smoothly
inferred← citeshttps://doi.org/10.48550/arxiv.0707.3205openalex-snapshot
Neutrality and Many-Valued Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1102.0240openalex-snapshot
Translating Labels to Hypersequents for Intermediate Logics with Geometric Kripke Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1104.0379openalex-snapshot
Proof-Theoretic Soundness and Completeness
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0354openalex-snapshot
Modality for Free: Notes on Adding the Tarskian Möglichkeit to Substructural Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4816openalex-snapshot
The Hidden Structural Rules of the Discontinuous Lambek Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03472openalex-snapshot
Density Elimination for Semilinear Substructural Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04852openalex-snapshot
Hypersequents and Systems of Rules: Embeddings and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03631openalex-snapshot
$\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.11818openalex-snapshot
Linear Logic, the $π$-calculus, and their Metatheory: A Recipe for Proofs as Processes
inferred← citeshttps://doi.org/10.48550/arxiv.2109.09591openalex-snapshot
Hypersequent Calculi for Intermediate Predicate Logics
inferred← citeshttps://doi.org/10.5281/zenodo.177002openalex-snapshot
FIGURE 4. Leucothoe flammosa n in New species and host associations of commensal leucothoid amphipods from coral reefs in Florida and Belize (Crustacea: Amphipoda)
inferred← citeshttps://doi.org/10.5281/zenodo.26337openalex-snapshot
Epimyrma Bernardi N. Sp., A New Parasitic Ant (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.5463/thesis.149openalex-snapshot
Semantically informed methods in structural proof theory
inferred← citeshttps://doi.org/10.5555/3329995.3330011openalex-snapshot
Gödel logic: from natural deduction to parallel computation
inferred← citeshttps://doi.org/10.70675/61bfbf53z121az472ez8c91ze9f6166c9a6aopenalex-snapshot
Applications of Foundational Proof Certificates in theorem proving
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.