Search results
From MaRDI portal
- logics 2016-04-13 Paper The decidability of the intensional fragment of classical linear logic 2015-08-17 Paper Extracting \(\mathsf{BB'IW}\) inhabitants...10 bytes (13 words) - 05:22, 7 October 2023
- condensed detachment 1990-01-01 Paper Separating minimal, intuitionist, and classical logic 1983-01-01 Paper Axiomatics for implication 1979-01-01 Paper Positive...10 bytes (14 words) - 07:58, 6 October 2023
- https://portal.mardi4nfdi.de/entity/Q3400637 2010-02-05 Paper A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL 2009-03-12 Paper Barendregt’s...10 bytes (13 words) - 10:15, 24 September 2023
- scalable approach to correct-by-construction process composition using classical linear logic inference 2023-11-09 Paper Machine Learning for Inductive...10 bytes (15 words) - 01:40, 13 December 2023
- Preserving Spine Reduction and Types 2009-10-22 Paper Computation with classical sequents 2008-08-15 Paper The heart of intersection type assignment: Normalisation...10 bytes (15 words) - 12:28, 28 January 2024
- de/entity/Q5813905 1952-01-01 Paper The permutability of rules in the classical inferential calculus 1952-01-01 Paper https://portal.mardi4nfdi.de/entity/Q5816112...10 bytes (17 words) - 07:47, 12 December 2023
- in the Stern-Brocot tree 2010-04-27 Paper Proof-finding algorithms for classical and subclassical propositional logics 2010-01-13 Paper Some Rough Consequence...10 bytes (15 words) - 11:02, 9 December 2023
- the Odd Order Theorem 2013-08-07 Paper Theory Presentation Combinators 2012-09-07 Paper Classical mathematics for a constructive world 2011-10-21 Paper MathScheme:...10 bytes (15 words) - 11:32, 7 October 2023
- 2013-08-09 Paper Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts 2012-07-20 Paper Kripke models for classical logic 2011-08-26...10 bytes (13 words) - 12:56, 12 December 2023
- and combinators 2019-01-31 Paper Proof-terms for classical and intuitionistic resolution 2019-01-15 Paper On the intuitionistic force of classical search...10 bytes (14 words) - 03:15, 9 December 2023
- From Focalization of Logic to the Logic of Focalization 2016-07-08 Paper Classical By-Need 2016-04-26 Paper On the Dependencies of Logical Rules 2015-10-01...10 bytes (13 words) - 05:01, 7 October 2023
- category perspective on connections in algebraic geometry 2025-01-10 Paper Classical distributive restriction categories 2024-08-27 Paper https://portal.mardi4nfdi...10 bytes (17 words) - 12:54, 7 October 2023
- Coppo-Dezani heritage 2008-06-24 Paper Strong Normalization of the Dual Classical Sequent Calculus 2008-05-27 Paper Normal forms for binary relations 2006-09-14...10 bytes (15 words) - 08:42, 6 October 2023
- Publication Date of Publication Type Compact inverse categories 2024-10-01 Paper Classical distributive restriction categories 2024-08-27 Paper Factorization systems...10 bytes (17 words) - 17:14, 9 December 2023
- 1976-01-01 Paper https://portal.mardi4nfdi.de/entity/Q4073358 1975-01-01 Paper Classical relevant logics. II 1974-01-01 Paper New axiomatics for relevant logics...10 bytes (16 words) - 09:04, 7 October 2023
- mardi4nfdi.de/entity/Q4499170 2001-03-06 Paper Intuitionistic choice and classical logic 2000-11-05 Paper https://portal.mardi4nfdi.de/entity/Q4944905 2000-03-22...10 bytes (15 words) - 15:11, 11 December 2023
- method for incompressible two-phase flows 2019-03-12 Paper Subdiffusion in classical and quantum nonlinear Schrödinger equations with disorder 2019-03-12 Paper...10 bytes (13 words) - 07:10, 7 October 2023
- Extensional Gödel functional interpretation. A consistency proof of classical analysis Combinators, \(\lambda\)-terms and proof theory Ein starker Normalisationssatz...15 bytes (189 words) - 08:24, 6 February 2024
- Proving in Higher Order Logics Combining and automating classical and non-classical logics in classical higher-order logics Experiments with discrimination-tree...15 bytes (618 words) - 02:03, 30 January 2024
- NP-completeness of a combinator optimization problem On the Logic of Expansion in Natural Language The absence and the presence of fixed point combinators Weak completeness...15 bytes (890 words) - 10:46, 30 January 2024
