Results 1  10
of
564
TRUTH AND CIRCULAR DEFINITIONS
"... This original and enticing book provides a fresh, unifying perspective on many old and new logicophilosophical conundrums. Its basic thesis is that many concepts central in ordinary and philosophical discourse are inherently circular and thus cannot be fully understood as long as one remains within ..."
Abstract
 Add to MetaCart
within the confines of a standard theory of definitions. As an alternative, the authors develop a revision theory of definitions, which allows definitions to be circular without this giving rise to contradiction (but, at worst, to “vacuous ” uses of definienda). The theory is applied with varying levels
Comparing Inductive and Circular Definitions: Parameters, Complexity and Games
, 2004
"... GuptaBelnapstyle circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
GuptaBelnapstyle circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.
A Note on Analysis and Circular Definitions
, 1998
"... this paper was presented at the Second National Meeting of the Italian Society of Analytic Philosophy, Vercelli (Italy), September 1996. We are thankful to the audience for stimulating comments and discussion. ..."
Abstract
 Add to MetaCart
this paper was presented at the Second National Meeting of the Italian Society of Analytic Philosophy, Vercelli (Italy), September 1996. We are thankful to the audience for stimulating comments and discussion.
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 569 (0 self)
 Add to MetaCart
. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal
Principal Curves
, 1989
"... Principal curves are smooth onedimensional curves that pass through the middle of a pdimensional data set, providing a nonlinear summary of the data. They are nonparametric, and their shape is suggested by the data. The algorithm for constructing principal curve starts with some prior summary, suc ..."
Abstract

Cited by 394 (1 self)
 Add to MetaCart
, such as the usual principalcomponent line. The curve in each successive iteration is a smooth or local average of the pdimensional points, where the definition of local is based on the distance in arc length of the projections of the points onto the curve found in the previous iteration. In this article principal
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract

Cited by 270 (33 self)
 Add to MetaCart
This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed
New definitions and separations for circular security
 In Public Key Cryptography
, 2012
"... Traditional definitions of encryption security guarantee secrecy for any plaintext that can be computed by an outside adversary. In some settings, such as anonymous credential or disk encryption systems, this is not enough, because these applications encrypt messages that depend on the secret key. A ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. A natural question to ask is do standard definitions capture these scenarios? One area of interest is ncircular security where the ciphertexts E(pk1, sk2), E(pk2, sk3),..., E(pkn−1, skn), E(pkn, sk1) must be indistinguishable from encryptions of zero. Acar et al. (Eurocrypt 2010) provided a CPA
Ambiguous, circular and polysemous: students’ definitions of
"... the “balance of nature ” metaphor ..."
Metaclasses are first class: the ObjVLisp model
 In Object Oriented Programming Systems Languages and Applications
, 1987
"... This paper shows how an attempt at a uniform and reflective definition resulted in an openended system supporting ObjVlisp, which we use to simulate objectoriented language extensions. We propose to unify Smalltalk classes and their terminal instances. This unification allows us to treat a class a ..."
Abstract

Cited by 127 (8 self)
 Add to MetaCart
as a “first class citizen”, to give a circular definition of the first metaclass, to access to the metaclass level and finally to control the instantiation link. Because each object is an instance of another one and because a metaclass is a real class inheriting from another one, the metaclass links
Unifying Recursive and Corecursive Definitions in Sheaf Categories
 In FoSSaCS
, 2004
"... In this paper we present a theorem for defining fixedpoints in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science in order to ensure convergency of circular definitions, such as (but not limited to) wellfounded recursion and cont ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we present a theorem for defining fixedpoints in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science in order to ensure convergency of circular definitions, such as (but not limited to) wellfounded recursion
Results 1  10
of
564