Free deduction: An analysis of ``computations in classical logic
From MaRDI portal
(Redirected from Free deduction: An analysis of ``computations in classical logic)
Free deduction: An analysis of ``computations'' in classical logic
Free deduction: An analysis of ``computations'' in classical logic
Recommendations
- Free logics: a survey
- Free logic and the quantified argument calculus
- scientific article; zbMATH DE number 883824
- scientific article; zbMATH DE number 1028821
- scientific article; zbMATH DE number 1749197
- scientific article; zbMATH DE number 3931007
- scientific article; zbMATH DE number 1867306
- A more unified approach to free logics
- Note on deduction theorems in contraction-free logics
- Automated deduction in classical and non-classical logics. Selected papers
Cited in
(32)- Classical logic, storage operators and second-order lambda-calculus
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus
- Proof-search in type-theoretic languages: An introduction
- A computational glimpse at the Leibniz and Frege hierarchies
- About classical logic and imperative programming
- Normalisation and subformula property for a system of classical logic with Tarski's rule
- The differential \(\lambda \mu\)-calculus
- A deconstruction of non-deterministic classical cut elimination
- A semantics of realisability for the classical propositional natural deduction
- Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective)
- Classical natural deduction
- Focusing in Linear Meta-logic
- Classical proofs via basic logic
- scientific article; zbMATH DE number 1231529 (Why is no real title available?)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- scientific article; zbMATH DE number 742720 (Why is no real title available?)
- Towards structurally-free theorem proving
- An estimation for the lengths of reduction sequences of the -calculus
- Cut-elimination and deductive polarization in complementary classical logic
- Strong normalization for all-style \(\mathbf{LK}^\mathrm{tq}\)
- Superdeduction in \(\bar{\lambda}\mu\tilde{\mu}\)
- Confluence for classical logic through the distinction between values and computations
- Cut elimination and normalization for generalized single and multi-conclusion sequent and natural deduction calculi
- Assertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof Theory
- Computer Science Logic
- Polarized and focalized linear and classical proofs
- A new connective in natural deduction, and its application to quantum computing
- A new connective in natural deduction, and its application to quantum computing
- Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules
- Classical proof forestry
- A quick overview on the quantum control approach to the lambda calculus
- A framework for proof systems
This page was built for publication: Free deduction: An analysis of ``computations in classical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264064)
