Results 31 to 40 of about 839,866 (101)

Explicit substitions and all that

Revista Colombiana de Computación, 2000
Explicit substitution calculi are extensions of the calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming ...
Mauricio Ayala Rincón, César Muñoz
doaj  

Extending Dynamic Doxastic Logic: Accommodating Iterated Beliefs And Ramsey Conditionals Within DDL [PDF]

, 1997
In this paper we distinguish between various kinds of doxastic theories. One distinction is between informal and formal doxastic theories. AGM-type theories of belief change are of the former kind, while Hintikka’s logic of knowledge and belief is of the
Lindström, Sten, Rabinowicz, Wiodek
core  

Hybrid type theory: a quartet in four movements [PDF]

, 2011
This paper sings a song -a song created by bringing together the work of four great names in the history of logic: Hans Reichenbach, Arthur Prior, Richard Montague, and Leon Henkin.
Areces, Carlos, Blackburn, Patrick, Huertas Sánchez, María Antonia, Manzano Arjona, María   +3 more
core   +1 more source

On the existence of Stone-Cech compactification

, 2010
In [G. Curi, "Exact approximations to Stone-Cech compactification'', Ann. Pure Appl. Logic, 146, 2-3, 2007, pp. 103-123] a characterization is obtained of the locales of which the Stone-Cech compactification can be defined in constructive type theory CTT,
Curi, Giovanni
core   +1 more source

Effective Interactive Proofs for Higher-Order Imperative Programs [PDF]

, 2011
We present a new approach for constructing and verifying higher-order, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is based on Hoare Type Theory.
Chlipala, Adam J., Malecha, Gregory Michael, Morrisett, John Gregory, Shinnar, Avraham Ever, Wisnesky, Ryan   +4 more
core  

The Vampire and the FOOL

, 2015
This paper presents new features recently implemented in the theorem prover Vampire, namely support for first-order logic with a first class boolean sort (FOOL) and polymorphic arrays.
Barrett C., Barrett C., Baumgartner P., Benzmüller C., de Moura L. M., Gupta A., Kotelnikov E., Reynolds A., Schulz S., Sutcliffe G., Sutcliffe G.   +10 more
core   +2 more sources

Reverse Mathematics and parameter-free Transfer

, 2018
Recently, conservative extensions of Peano and Heyting arithmetic in the spirit of Nelson's axiomatic approach to Nonstandard Analysis, have been proposed.
Berg, Benno van den, Sanders, Sam
core   +1 more source

A Framework for Program Development Based on Schematic Proof [PDF]

, 1993
Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. The difference involves often only a slight shift of perspective: admitting metavariables into proofs. We propose that such calculi should be
Basin, David, Bundy, Alan, Kraan, Ina, Matthews, Sean   +3 more
core   +1 more source

Arithmetical conservation results

, 2017
In this paper we present a proof of Goodman's Theorem, a classical result in the metamathematics of constructivism, which states that the addition of the axiom of choice to Heyting arithmetic in finite types does not increase the collection of provable ...
Aczel, Beeson, Beeson, Benno van den Berg, Coquand, Feferman, Feferman, Goodman, Goodman, Gordeev, Hunter, Kohlenbach, Kohlenbach, Kohlenbach, Kohlenbach, Kreisel, Lotte van Slooten, Martin-Löf, Martin-Löf, Mints, Renardel de Lavalette, Schweber, Schwichtenberg, Troelstra, Troelstra, Troelstra, van Oosten, van Oosten, van Slooten   +28 more
core   +1 more source

Fast Cut-Elimination using Proof Terms: An Empirical Study

, 2018
Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Ebner, Gabriel
core   +2 more sources