Results 11 to 20 of about 268 (109)

ACL2(ml):machine-learning for ACL2 [PDF]

, 2014
ACL2(ml) is an extension for the Emacs interface of ACL2. This tool uses machine-learning to help the ACL2 user during the proof-development. Namely, ACL2(ml) gives hints to the user in the form of families of similar theorems, and generates auxiliary ...
Heras, Jónathan, Jónathan Heras, Komendantskaya, Ekaterina, Ekaterina Komendantskaya   +3 more
core   +1 more source

Mutual Exclusion by Interpolation [PDF]

, 2012
The question of what constraints must hold for a predicate to behave as a (partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis
Jael Kriener, Andy King, King, Andy, Kriener, Jael   +3 more
core   +1 more source

Learning in games with unstable equilibria [PDF]

, 2005
We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning processes.
Benaim, M., Benaim, Michel, Hofbauer, J., Hopkins, Ed, Hopkins, E., Hofbauer, Josef   +5 more
core   +1 more source

Non-reactive strategies in decision-form games [PDF]

, 2009
In this paper we propose a concept of rationalizable solution for two-player decision-form games: the solution by iterated elimination of non-reactive strategies. Several original theorems are proved about this kind of solution.
Ricciardello, Angela, David Carfi`, Carfì, David, Angela Ricciardello   +3 more
core   +1 more source

Algebraic Proofs of Cut Elimination

, 2018
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive.
Jeremy Avigad (3881521)
core   +1 more source

Systematic construction of natural deduction systems for many-valued logics [PDF]

, 1993
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics ...
Christian G. Fermüller, Technische Universität Wien, Matthias Baaz, Richard Zach   +3 more
core   +2 more sources

Deforestation of Functional Programs through Type Inference [PDF]

, 2000
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestation method which is based on a single, local transformation rule. In return,
Chitil, Olaf
core  

Reverse mathematics and well-ordering principles [PDF]

, 2011
The paper is concerned with generally Pi^1_2 sentences of the form 'if X is well ordered then f(X) is well ordered', where f is a standard proof theoretic function from ordinals to ordinals.
Rathjen, Michael, Andreas Weiermann, Weiermann, Andreas, Michael Rathjen   +3 more
core   +1 more source

A general analysis of cut-elimination by CERes [PDF]

, 2009
Das Prinzip der Beweiskompositionalit¨at wird durch die Inferenzregel Schnitt formal vertreten. Beweise einfacher Lemmas k¨onnen durch die Schnittregel zusammengesetzt werden, um damit komplexe Theoremen beweisen zu k¨onnen.
Woltzenlogel Paleo, Bruno
core  

Extended normal form theorems for logical proofs from axioms

, 2000
We present an exact modeling of cut-free arithmetic by cut-free predicate logic.
Arai, Toshiyasu, Mints, Grigori, Grigori Mints, Toshiyasu Arai   +3 more
core   +1 more source