Sciweavers

1101 search results - page 31 / 221
» Forcing in proof theory
Sort
View
AML
2005
104views more  AML 2005»
13 years 7 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ECIS
2000
13 years 9 months ago
Towards a Grounded Theory of Information Systems for the International Firm: Critical Variables and Causal Networks
-International Information Systems, often of critical importance for the operations of the multinational enterprise, are poorly researches and there is a dearth of theoretical fram...
Hans P. Lehmann
FMOODS
2007
13 years 9 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel