Results for 'Program extraction from proofs'

1000+ found
Order:
  1.  18
    Program Extraction from Normalization Proofs.Ulrich Berger, Stefan Berghofer, Pierre Letouzey & Helmut Schwichtenberg - 2006 - Studia Logica 82 (1):25-49.
    This paper describes formalizations of Tait's normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machine-extracted that implement variants of the well-known normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  28
    Refined program extraction from classical proofs.Ulrich Berger, Wilfried Buchholz & Helmut Schwichtenberg - 2002 - Annals of Pure and Applied Logic 114 (1-3):3-25.
    The paper presents a refined method of extracting reasonable and sometimes unexpected programs from classical proofs of formulas of the form ∀x∃yB . We also generalize previously known results, since B no longer needs to be quantifier-free, but only has to belong to a strictly larger class of so-called “goal formulas”. Furthermore we allow unproven lemmas D in the proof of ∀x∃yB , where D is a so-called “definite” formula.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  3.  4
    REVIEWS-Refined program extraction from classical proofs.U. Berger, W. Buchholz, H. Schwichtenberg & N. Danner - 2003 - Bulletin of Symbolic Logic 9 (1):47-48.
  4.  7
    Programs from proofs using classical dependent choice.Monika Seisenberger - 2008 - Annals of Pure and Applied Logic 153 (1-3):97-110.
    This article generalises the refined A-translation method for extracting programs from classical proofs [U. Berger,W. Buchholz, H. Schwichtenberg, Refined program extraction from classical proofs, Annals of Pure and Applied Logic 114 3–25] to the scenario where additional assumptions such as choice principles are involved. In the case of choice principles, this is done by adding computational content to the ‘translated’ assumptions, an idea which goes back to [S. Berardi, M. Bezem, T. Coquand, On the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  14
    Berger U., Buchholz W., and Schwichtenberg H.. Refined program extraction from classical proofs. Annals of pure and applied logic, vol. 114 (2002), pp. 3–25. [REVIEW]N. Danner - 2003 - Bulletin of Symbolic Logic 9 (1):47-48.
  6.  24
    Program extraction for 2-random reals.Alexander P. Kreuzer - 2013 - Archive for Mathematical Logic 52 (5-6):659-666.
    Let ${2-\textsf{RAN}}$ be the statement that for each real X a real 2-random relative to X exists. We apply program extraction techniques we developed in Kreuzer and Kohlenbach (J. Symb. Log. 77(3):853–895, 2012. doi:10.2178/jsl/1344862165), Kreuzer (Notre Dame J. Formal Log. 53(2):245–265, 2012. doi:10.1215/00294527-1715716) to this principle. Let ${{\textsf{WKL}_0^\omega}}$ be the finite type extension of ${\textsf{WKL}_0}$ . We obtain that one can extract primitive recursive realizers from proofs in ${{\textsf{WKL}_0^\omega} + \Pi^0_1-{\textsf{CP}} + 2-\textsf{RAN}}$ , i.e., if ${{\textsf{WKL}_0^\omega} (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  41
    Non-principal ultrafilters, program extraction and higher-order reverse mathematics.Alexander P. Kreuzer - 2012 - Journal of Mathematical Logic 12 (1):1250002-.
    We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher-order arithmetic. Let [Formula: see text] be the statement that a non-principal ultrafilter on ℕ exists and let [Formula: see text] be the higher-order extension of ACA0. We show that [Formula: see text] is [Formula: see text]-conservative over [Formula: see text] and thus that [Formula: see text] is conservative over PA. Moreover, we provide a program extraction method and show that from a proof (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  16
    Extracting the resolution algorithm from a completeness proof for the propositional calculus.Robert Constable & Wojciech Moczydłowski - 2010 - Annals of Pure and Applied Logic 161 (3):337-348.
    We prove constructively that for any propositional formula in Conjunctive Normal Form, we can either find a satisfying assignment of true and false to its variables, or a refutation of showing that it is unsatisfiable. This refutation is a resolution proof of ¬. From the formalization of our proof in Coq, we extract Robinson’s famous resolution algorithm as a Haskell program correct by construction. The account is an example of the genre of highly readable formalized mathematics.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  9.  15
    Light monotone Dialectica methods for proof mining.Mircea-Dan Hernest - 2009 - Mathematical Logic Quarterly 55 (5):551-561.
    In view of an enhancement of our implementation on the computer, we explore the possibility of an algorithmic optimization of the various proof-theoretic techniques employed by Kohlenbach for the synthesis of new effective uniform bounds out of established qualitative proofs in Numerical Functional Analysis. Concretely, we prove that the method of “colouring” some of the quantifiers as “non-computational” extends well to ε-arithmetization, elimination-of-extensionality and model-interpretation.
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  37
    Extended Curry‐Howard terms for second‐order logic.Pimpen Vejjajiva - 2013 - Mathematical Logic Quarterly 59 (4-5):274-285.
    In order to allow the use of axioms in a second‐order system of extracting programs from proofs, we define constant terms, a form of Curry‐Howard terms, whose types are intended to correspond to those axioms. We also define new reduction rules for these new terms so that all consequences of the axioms can be represented. We finally show that the extended Curry‐Howard terms are strongly normalizable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  34
    Intuitionistic fixed point logic.Ulrich Berger & Hideki Tsuiki - 2021 - Annals of Pure and Applied Logic 172 (3):102903.
    We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction free formulas. The interpretation is shown to be sound with respect to a domain-theoretic denotational semantics and a corresponding lazy operational semantics of a functional language for extracted programs. We also (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  30
    Proof and infinity: response to andré porto.O. Chateaubriand - 2008 - Manuscrito 31 (1):45-49.
    The main issue André Porto raises in his paper concerns the use of dot notation to indicate an infinite set of hypotheses. Whereas I agree that one cannot extract a unique infinite expansion from a finite initial segment, in my response I argue that this holds for finite expansions as well. I further explain how my remarks on infinite proof structures are neither motivated by the impact of Gödel’s incompleteness theorems on Hilbert’s program, nor by a negative view (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  19
    Exploring Computational Contents of Intuitionist Proofs.Geiza Hamazaki da Silva, Edward Haeusler & Paulo Veloso - 2005 - Logic Journal of the IGPL 13 (1):69-93.
    One of the main problems in computer science is to ensure that programs are implemented in such a way that they satisfy a given specification. There are many studies about methods to prove correctness of programs. This work presents a method, belonging to the constructive synthesis or proofs-as-programs paradigm, that comes from the Curry-Howard isomorphism and extracts the computational contents of intuitionist proofs. The synthesis process proposed produces a program in an imperative language from a (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  14. Alexander Leitsch/From the Editor 3–5 Matthias Baaz and Rosalie Iemhoff/Gentzen Calculi for the Existence Predicate 7–23 Ulrich Berger, Stefan Berghofer, Pierre Letouzey and Helmut Schwichtenberg/Program Extraction from[REVIEW]Alexander Leitsch - 2006 - Studia Logica 82:40.
     
    Export citation  
     
    Bookmark  
  15.  21
    Łukasiewicz Logic: From Proof Systems To Logic Programming.George Metcalfe, Nicola Olivetti & Dov Gabbay - 2005 - Logic Journal of the IGPL 13 (5):561-585.
    We present logic programming style “goal-directed” proof methods for Łukasiewicz logic Ł that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of Ł with rational constants.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  17
    System ST toward a type system for extraction and proofs of programs.Christophe Raffalli - 2003 - Annals of Pure and Applied Logic 122 (1-3):107-130.
    We introduce a new type system called “System ST” , based on subtyping, and prove the basic property of the system. We show the extraordinary expressive power of the system which leads us to think that it could be a good candidate for doing both proof and extraction of programs.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  41
    Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
    This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). In (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  18.  32
    Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus $${LT_\to^{t}}$$ L T → t for Implicational Ticket Entailment.Katalin Bimbó & J. Michael Dunn - 2014 - Logica Universalis 8 (2):141-164.
    The decidability of the logic of pure ticket entailment means that the problem of inhabitation of simple types by combinators over the base { B, B′, I, W } is decidable too. Type-assignment systems are often formulated as natural deduction systems. However, our decision procedure for this logic, which we presented in earlier papers, relies on two sequent calculi and it does not yield directly a combinator for a theorem of ${T_\to}$. Here we describe an algorithm to extract an inhabitant (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  26
    A short introduction to intuitionistic logic.G. E. Mint︠s︡ - 2000 - New York: Kluwer Academic / Plenum Publishers.
    Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  20.  12
    Central and Peripheral Shoulder Fatigue Pre-screening Using the Sigma–Lognormal Model: A Proof of Concept.Anaïs Laurent, Réjean Plamondon & Mickael Begon - 2020 - Frontiers in Human Neuroscience 14:535282.
    Background: Clinical tests for detecting central and peripheral shoulder fatigue are limited. The discrimination of these two types of fatigue is necessary to better adapt recovery intervention. The Kinematic Theory of Rapid Human Movements describes the neuromotor impulse response using lognormal functions and has many applications in pathology detection. The ideal motor control is modeled and a change in the neuromuscular system is reflected in parameters extracted according to this theory. Objective: The objective of this study was to assess whether (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  17
    Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert.Henri Lombardi - 2006 - Annals of Pure and Applied Logic 137 (1-3):256-290.
    A possible relevant meaning of Hilbert’s program is the following one: “give a constructive semantic for classical mathematics”. More precisely, give a systematic interpretation of classical abstract proofs about abstract objects, as constructive proofs about constructive versions of these objects.If this program is fulfilled we are able “at the end of the tale” to extract constructive proofs of concrete results from classical abstract proofs of these results.Dynamical algebraic structures or geometric theories seem to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22.  28
    Injuries to unborn children: Extracts from the report of the Law Commission.Samuel Cooke, Claud Bicknell, Aubrey L. Diamond, Derek Hodgson, Norman S. Marsh & J. M. Cartwright Sharp - 1975 - Journal of Medical Ethics 1 (3):111-115.
    We are printing, by kind permission of the Law Commission, two sections of the report of the Law Commission on injuries to unborn children. This report was the result of a request to the Law Commission by the Lord Chancellor at the time (Lord Hailsham of Saint Marylebone) to advise on `what the nature and extent of civil liability for antenatal injury should be'. The Law Commission followed its usual practice in such circumstances of consulting various bodies and obtaining expert (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  23.  33
    Dialectica interpretation of well-founded induction.Helmut Schwichtenberg - 2008 - Mathematical Logic Quarterly 54 (3):229-239.
    From a classical proof that the gcd of natural numbers a1 and a2 is a linear combination of the two, we extract by Gödel's Dialectica interpretation an algorithm computing the coefficients. The proof uses the minimum principle. We show generally how well-founded recursion can be used to Dialectica interpret well-founded induction, which is needed in the proof of the minimum principle. In the special case of the example above it turns out that we obtain a reasonable extracted term, representing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  22
    Gödel functional interpretation and weak compactness.Ulrich Kohlenbach - 2012 - Annals of Pure and Applied Logic 163 (11):1560-1579.
    In recent years, proof theoretic transformations that are based on extensions of monotone forms of Gödel’s famous functional interpretation have been used systematically to extract new content from proofs in abstract nonlinear analysis. This content consists both in effective quantitative bounds as well as in qualitative uniformity results. One of the main ineffective tools in abstract functional analysis is the use of sequential forms of weak compactness. As we recently verified, the sequential form of weak compactness for bounded (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  25.  22
    The Computational Content of Classical Arithmetic to Appear in a Festschrift for Grigori Mints.Jeremy Avigad - unknown
    Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various methods of extracting computational information from proofs in classical first-order arithmetic, and reflects on some of the relationships between them. Variants of the Godel-Gentzen double-negation translation, some not so well known, serve to provide canonical and efficient computational interpretations of that theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  45
    Financing reparations programs: Reflections from international experience.Alexander Segovia - 2006 - In De Greiff Pablo (ed.), The handbook of reparations. New York: Oxford University Press. pp. 669--670.
    One of the least studied aspects of programs of reparation, both in theory and in practice, is financing. This is odd given the fact that mobilizing resources, both domestic and foreign, is politically one of the most difficult tasks any society can undertake. This paper centers on the subject of financing reparation programs and attempts to answer the following questions: Which factors play a role in the process of mobilizing domestic and foreign resources to finance reparations? Is financing solely a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27.  16
    Financing reparations programs: reflections from international experience a DE GREIFF, P.A. Segovia - 2006 - In De Greiff Pablo (ed.), The handbook of reparations. New York: Oxford University Press.
    One of the least studied aspects of programs of reparation, both in theory and in practice, is financing. This is odd given the fact that mobilizing resources, both domestic and foreign, is politically one of the most difficult tasks any society can undertake. This paper centers on the subject of financing reparation programs and attempts to answer the following questions: Which factors play a role in the process of mobilizing domestic and foreign resources to finance reparations? Is financing solely a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  5
    Extracting information from resolution proof trees.David Luckham & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (1):27-54.
  29. Bounds extracted by Kreisel from ineffective proofs.Horst Luckhardt - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana: About and Around Georg Kreisel. A K Peters. pp. 289--300.
     
    Export citation  
     
    Bookmark  
  30.  38
    Extracting Algorithms from Intuitionistic Proofs.Fernando Ferreira & António Marques - 1998 - Mathematical Logic Quarterly 44 (2):143-160.
    This paper presents a new method - which does not rely on the cut-elimination theorem - for characterizing the provably total functions of certain intuitionistic subsystems of arithmetic. The new method hinges on a realizability argument within an infinitary language. We illustrate the method for the intuitionistic counterpart of Buss's theory Smath image, and we briefly sketch it for the other levels of bounded arithmetic and for the theory IΣ1.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Extracting plans from reinforcement learners.Ron Sun - unknown
    forcement learning algorithms that generate only reactive policies and existing probabilistic planning algorithms that requires a substantial amount of a priori knowledge in order to plan we devise a two stage bottom up learning to plan process in which rst reinforcement learn ing dynamic programming is applied without the use of a priori domain speci c knowledge to acquire a reactive policy and then explicit plans are extracted from the learned reactive policy Plan extraction is based on a (...)
     
    Export citation  
     
    Bookmark  
  32.  17
    A Proof-Theoretic Bound Extraction Theorem for CAT $$(\kappa )$$ ( κ ) -Spaces.U. Kohlenbach & A. Nicolae - 2017 - Studia Logica 105 (3):611-624.
    Starting in 2005, general logical metatheorems have been developed that guarantee the extractability of uniform effective bounds from large classes of proofs of theorems that involve abstract metric structures X. In this paper we adapt this to the class of CAT\)-spaces X for \ and establish a new metatheorem that explains specific bound extractions that recently have been achieved in this context as instances of a general logical phenomenon.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  46
    Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
    Let the chain antichain principle (CAC) be the statement that each partial order on $\mathbb{N}$ possesses an infinite chain or an infinite antichain. Chong, Slaman, and Yang recently proved using forcing over nonstandard models of arithmetic that CAC is $\Pi^1_1$-conservative over $\text{RCA}_0+\Pi^0_1\text{-CP}$ and so in particular that CAC does not imply $\Sigma^0_2$-induction. We provide here a different purely syntactical and constructive proof of the statement that CAC (even together with WKL) does not imply $\Sigma^0_2$-induction. In detail we show using a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34.  17
    Making It Count: Extracting Real World Data from Compassionate Use and Expanded Access Programs.Ori Rozenberg & Dov Greenbaum - 2020 - American Journal of Bioethics 20 (7):89-92.
    Volume 20, Issue 7, July 2020, Page 89-92.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  14
    Logical metatheorems for accretive and (generalized) monotone set-valued operators.Nicholas Pischke - 2023 - Journal of Mathematical Logic 24 (2).
    Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  22
    Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation.Ulrich Kohlenbach - 1993 - Annals of Pure and Applied Logic 64 (1):27-94.
    Kohlenbach, U., Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Annals of Pure and Applied Logic 64 27–94.We consider uniqueness theorems in classical analysis having the form u ε U, v1, v2 ε Vu = 0 = G→v 1 = v2), where U, V are complete separable metric spaces, Vu is compact in V and G:U x V → is a constructive function.If is proved by arithmetical means from (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  37.  10
    The computational content of Nonstandard Analysis.Sam Sanders - unknown
    Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded middle and which involve only two quantifier alternations. By contrast, we show that the proof mining of (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  38.  15
    Response to Open Peer Commentary “Making It Count: Extracting Real World Data from Compassionate Use and Expanded Access Programs”.Tobias B. Polak, Joost van Rosmalen & Carin A. Uyl – De Groot - 2020 - American Journal of Bioethics 20 (11):W4-W5.
    In their open peer commentary: “Making It Count: Extracting Real World Data from Compassionate Use and Expanded Access Programs”, Rozenberg and Greenbaum discuss impo...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  21
    From Work to Proof of Work: Meaning and Value after Blockchain.Jeffrey West Kirkwood - 2022 - Critical Inquiry 48 (2):360-380.
    The price of Bitcoin is once more soaring. From early October 2020 to early January 2021, the price of a single Bitcoin token went from roughly $10,000 to nearly $65,000, reinspiring the hopes of the crypto-faithful in the inevitability of a future beyond centralized banking and leaving the rest to dread the jargon of computational libertarianism. The speculative betting driving this recent price action, however, belies a more rudimentary and overlooked shift in the digital economy signaled by cryptocurrencies (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  40
    From predication to programming.Karel Lambert - 2001 - Minds and Machines 11 (2):257-265.
    A free logic is one in which a singular term can fail to refer to an existent object, for example, `Vulcan' or `5/0'. This essay demonstrates the fruitfulness of a version of this non-classical logic of terms (negative free logic) by showing (1) how it can be used not only to repair a looming inconsistency in Quine's theory of predication, the most influential semantical theory in contemporary philosophical logic, but also (2) how Beeson, Farmer and Feferman, among others, use it (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  41.  47
    Term extraction and Ramsey's theorem for pairs.Alexander P. Kreuzer & Ulrich Kohlenbach - 2012 - Journal of Symbolic Logic 77 (3):853-895.
    In this paper we study with proof-theoretic methods the function(al) s provably recursive relative to Ramsey's theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functional provably recursive from $RCA_0 + COH + \Pi _1^0 - CP$ are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that $WKL_0 + (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42.  11
    Tableaux for constructive concurrent dynamic logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  32
    Effective Bounds from ineffective proofs in analysis: An application of functional interpretation and majorization.Ulrich Kohlenbach - 1992 - Journal of Symbolic Logic 57 (4):1239-1273.
    We show how to extract effective bounds Φ for $\bigwedge u^1 \bigwedge v \leq_\gamma tu \bigvee w^\eta G_0$ -sentences which depend on u only (i.e. $\bigwedge u \bigwedge v \leq_\gamma tu \bigvee w \leq_\eta \Phi uG_0$ ) from arithmetical proofs which use analytical assumptions of the form \begin{equation*}\tag{*}\bigwedge x^\delta\bigvee y \leq_\rho sx \bigwedge z^\tau F_0\end{equation*} (γ, δ, ρ, and τ are arbitrary finite types, η ≤ 2, G0 and F0 are quantifier-free, and s and t are closed terms). (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  44.  77
    Breve storia dell'etica.Sergio Cremaschi - 2012 - Roma RM, Italia: Carocci.
    The book reconstructs the history of Western ethics. The approach chosen focuses the endless dialectic of moral codes, or different kinds of ethos, moral doctrines that are preached in order to bring about a reform of existing ethos, and ethical theories that have taken shape in the context of controversies about the ethos and moral doctrines as means of justifying or reforming moral doctrines. Such dialectic is what is meant here by the phrase ‘moral traditions’, taken as a name for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  45.  28
    Uniform heyting arithmetic.Ulrich Berger - 2005 - Annals of Pure and Applied Logic 133 (1):125-148.
    We present an extension of Heyting arithmetic in finite types called Uniform Heyting Arithmetic that allows for the extraction of optimized programs from constructive and classical proofs. The system has two sorts of first-order quantifiers: ordinary quantifiers governed by the usual rules, and uniform quantifiers subject to stronger variable conditions expressing roughly that the quantified object is not computationally used in the proof. We combine a Kripke-style Friedman/Dragalin translation which is inspired by work of Coquand and Hofmann (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  46.  63
    Logical theory and semantic analysis: essays dedicated to Stig Kanger on his fiftieth birthday.Stig Kanger & Sören Stenlund (eds.) - 1974 - Boston: Reidel.
    Lewis, D. Semantic analyses for dyadic deontic logic.--Salomaa, A. Some remarks concerning many-valued propositional logics.--Chellas, B. F. Conditional obligation.--Jeffrey, R.C. Remarks on interpersonal utility theory.--Hintikka, J. On the proper treatment of quantifiers in Montague semantics.--Mayoh, B.H. Extracting information from logical proofs.--Åqvist, L. A new approach to the logical theory of actions and causality.--Pörn, I. Some basic concepts of action.--Bouvère, K. de. Some remarks concerning logical and ontological theories.--Hacking, I. Combined evidence.--Äberg, C. Solution to a problem raised by Stig (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  47.  31
    P. C. Gilmore. A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus. English, with English, French, German, Russian, and Spanish summaries. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, Butterworths, London, 1960, pp. 265–273. - J. Porte, P. C. Gilmore, Dag H. Prawitz, Håkon Prawitz, and Neri Voghera. Discussion. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, Butterworths, London, 1960, p. 273. - P. C. Gilmore. A proof method for quantification theory: Its justification and realization. IBM journal of research and development, vol. 4 , pp. 28–35. [REVIEW]J. A. Robinson - 1996 - Journal of Symbolic Logic 31 (1):124-125.
  48. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49.  16
    Strongly uniform bounds from semi-constructive proofs.Philipp Gerhardy & Ulrich Kohlenbach - 2006 - Annals of Pure and Applied Logic 141 (1):89-107.
    In [U. Kohlenbach, Some logical metatheorems with applications in functional analysis, Trans. Amer. Math. Soc. 357 89–128], the second author obtained metatheorems for the extraction of effective bounds from classical, prima facie non-constructive proofs in functional analysis. These metatheorems for the first time cover general classes of structures like arbitrary metric, hyperbolic, CAT and normed linear spaces and guarantee the independence of the bounds from parameters ranging over metrically bounded spaces. Recently ]), the authors obtained generalizations (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50. Tem: Of.Yehuda Rav - unknown
    Among the aims of the author in this wide-ranging article is to draw attention to the numerous formal sciences which so far have received little scrutiny, if at all, on the part of philosophers of mathematics and of science in general. By the formal sciences the author understands such mathematical disciplines as operations research, control theory, signal processing, cluster analysis, game theory, and so on. First, the author presents a long list of such formal sciences with a detailed discussion of (...)
    No categories
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000