Results 1  10
of
606
An approach to the finitistic . . .
, 2007
"... Let R be a finite dimensional kalgebra over an algebraically closed field k and mod R be the category of all finitely generated left Rmodules. For a given full subcategory X of mod R, we denote by pfd X the projective finitistic dimension of X. That is, pfd X: = sup {pd X: X ∈ X and pd X < ∞}. ..."
Abstract
 Add to MetaCart
; ∞}. It was conjectured by H. Bass in the 60’s that the projective finitistic dimension pfd(R): = pfd(mod R) has to be finite. Since then, much work has been done toward the proof of this conjecture. Recently, K. Igusa and J. Todorov defined in [9] a function Ψ: mod R → N, which turned out to be useful to prove that pfd
On the length of proofs of finitistic consistency statements in first order theories
, 1986
"... ..."
Towards a theory of scalefree graphs: Definition, properties, and implications
 Internet Mathematics
, 2005
"... Abstract. There is a large, popular, and growing literature on “scalefree ” networks with the Internet along with metabolic networks representing perhaps the canonical examples. While this has in many ways reinvigorated graph theory, there is unfortunately no consistent, precise definition of scale ..."
Abstract

Cited by 137 (12 self)
 Add to MetaCart
of scalefree graphs and few rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many inherent contradictions and that the most celebrated claims regarding the Internet and biology are verifiably false. In this paper, we introduce a structural
Formal certification of codebased cryptographic proofs
 4 th Workshop on Formal and Computational Cryptography (FCC
, 2008
"... As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Gamebased techniques provide a popular approach in which proofs are structured as sequences of games, and in which proof steps es ..."
Abstract

Cited by 84 (25 self)
 Add to MetaCart
establish the validity of transitions between successive games. Codebased techniques form an instance of this approach that takes a codecentric view of games, and that relies on programming language theory to justify proof steps. While codebased techniques contribute to formalize the security statements
Towards Lean Proof Checking
 Proceedings of DISCO'96, volume 1128 of Lecture Notes in Computer Science
, 1996
"... . Logical formal systems are inefficient at computations. In order to increase their efficiency, we aim to extend these systems with computational power. In this paper, we suggest a general, powerful syntax, called oracle types, to extend type theories with computational power; the resulting systems ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Logical formal systems are inefficient at computations. In order to increase their efficiency, we aim to extend these systems with computational power. In this paper, we suggest a general, powerful syntax, called oracle types, to extend type theories with computational power; the resulting
Towards Practical Proofs of Class Correctness
 In ZB 2003: Formal Specification and Development in Z and B, Lecture Notes in Computer Science
, 2003
"... Preliminary steps towards a theory, framework and process for proving that contractequipped classes satisfy their contracts, including when the runtime structure involves pointers; and its application to correctness proofs of routines from a LINKED_LIST class, such as element removal and list reve ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Preliminary steps towards a theory, framework and process for proving that contractequipped classes satisfy their contracts, including when the runtime structure involves pointers; and its application to correctness proofs of routines from a LINKED_LIST class, such as element removal and list
Towards a Domain Theory for Termination Proofs
, 1995
"... We present a general framework for termination proofs for HigherOrder Rewrite Sys tems The method is tailormade for having simple proofs showing the termination of enriched calculi A semantical method for termination proofs of rstorder term rewriting systems has been presen ted by Zantema at the CT ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We present a general framework for termination proofs for HigherOrder Rewrite Sys tems The method is tailormade for having simple proofs showing the termination of enriched calculi A semantical method for termination proofs of rstorder term rewriting systems has been presen ted by Zantema
Towards A Theory Of Specifications, Programs And Proofs
 In Proceedings of the 7th. Nordic Workshop on Programming Theory, PMG report 86, Goteborg
, 1995
"... this paper we investigate a theory in which the notion of program as method of computation is singled out. As a first step towards a theory of specifications, we separate the notions of datatype and proposition and define a calculus for program verification, where programs can be written and then pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper we investigate a theory in which the notion of program as method of computation is singled out. As a first step towards a theory of specifications, we separate the notions of datatype and proposition and define a calculus for program verification, where programs can be written
Towards a proof theory of Gödel modal logics
 Logical Methods in Computer Science
"... Vol. 7 (2:10) 2011, pp. 1–27 www.lmcsonline.org ..."
Results 1  10
of
606