Results 1  10
of
668
An Efficient Approach to Nominal Equalities in Hybrid Logic Tableaux
"... This is a draft version of a paper published on the Journal of Applied NonClassical Logics. It should not be cited, quoted or reproduced. Basic hybrid logic extends modal logic with the possibility of naming worlds by means of a distinguished class of atoms (called nominals) and the socalled satis ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
called satisfaction operator, that allows one to state that a given formula holds at the world named a, for some nominal a. Hence, in particular, hybrid formulae include “equality ” assertions, stating that two nominals are distinct names for the same world. The treatment of such nominal equalities in proof systems
Nominal
"... A color space is a mathematical representation of a set of colors. The three most popular color models are RGB (used in computer graphics); YIQ, YUV, or YCbCr (used in video systems); and CMYK (used in color printing). However, none of these color spaces are directly related to the intuitive notions ..."
Abstract
 Add to MetaCart
.1). The indicated diagonal of the cube, with equal amounts of each primary component, represents various gray levels. Table 3.1 contains the RGB values for 100 % amplitude, 100 % saturated color bars, a common video test signal.
Nominal Logic: A First Order Theory of Names and Binding
 Information and Computation
, 2001
"... This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal L ..."
Abstract

Cited by 219 (15 self)
 Add to MetaCart
This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal
Nominal Unification
 Theoretical Computer Science
, 2003
"... We present a generalisation of firstorder unification to the practically important case of equations between terms involving binding operations. A substitution of terms for variables solves such an equation if it makes the equated terms #equivalent, i.e. equal up to renaming bound names. For the a ..."
Abstract

Cited by 70 (28 self)
 Add to MetaCart
We present a generalisation of firstorder unification to the practically important case of equations between terms involving binding operations. A substitution of terms for variables solves such an equation if it makes the equated terms #equivalent, i.e. equal up to renaming bound names
Nominal algebra
, 2006
"... Nominal terms are a termlanguage used to accurately and expressively represent systems with binding. We present Nominal Algebra (NA), a theory of algebraic equality on nominal terms. Builtin support for binding in the presence of metavariables allows NA to closely mirror informal mathematical us ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Nominal terms are a termlanguage used to accurately and expressively represent systems with binding. We present Nominal Algebra (NA), a theory of algebraic equality on nominal terms. Builtin support for binding in the presence of metavariables allows NA to closely mirror informal mathematical
Nominal substitution at work with the global and converse modalities
 Advances in Modal Logic
, 2010
"... This is a draft version of a paper appeared on the Proceedings of AIMAL 2010. It should not be cited, quoted or reproduced. This paper represents a continuation of a previous work, where a practical approach to the treatment of nominal equalities in tableaux for basic Hybrid Logic ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
This is a draft version of a paper appeared on the Proceedings of AIMAL 2010. It should not be cited, quoted or reproduced. This paper represents a continuation of a previous work, where a practical approach to the treatment of nominal equalities in tableaux for basic Hybrid Logic
NOMINAL RESTATEMENT∗
"... This paper identifies, explores and provides a formal analysis to a phenomenon that I will call nominal restatement. Nominal restatement (NR) bears a certain similarity to nominal apposition (NA). However, whether an equality sign can be put between these notions depends largely on our assumptions a ..."
Abstract
 Add to MetaCart
This paper identifies, explores and provides a formal analysis to a phenomenon that I will call nominal restatement. Nominal restatement (NR) bears a certain similarity to nominal apposition (NA). However, whether an equality sign can be put between these notions depends largely on our assumptions
2006) Approximately normal tests for equal predictive accuracy in nested models. Journal of Econometrics forthcoming
"... Forecast evaluation often compares a parsimonious null model to a larger model that nests the null model. Under the null that the parsimonious model generates the data, the larger model introduces noise into its forecasts by estimating parameters whose population values are zero. We observe that the ..."
Abstract

Cited by 149 (14 self)
 Add to MetaCart
is zero. We refer to nonstandard limiting distributions derived in Clark and McCracken (2001, 2005a) to argue that use of standard normal critical values will yield actual sizes close to, but a little less than, nominal size. Simulation evidence supports our recommended procedure. West thanks the National
Results 1  10
of
668