Sciweavers

91 search results - page 13 / 19
» aml 2007
Sort
View
AML
2006
106views more  AML 2006»
13 years 10 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
AML
2005
76views more  AML 2005»
13 years 9 months ago
Perfect and bipartite IMTL-algebras and disconnected rotations of prelinear semihoops
IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an i...
Carles Noguera, Francesc Esteva, Joan Gispert
AML
2005
104views more  AML 2005»
13 years 9 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
AML
2005
84views more  AML 2005»
13 years 9 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite
AML
2005
73views more  AML 2005»
13 years 9 months ago
Strong reducibility of partial numberings
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
Dieter Spreen