Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because ...

Nominal logic is a variant of first-order logic in which abstract syntax with names and binding is formalized in terms of two basic operations: name-swapping and freshness. It relies on two important principles: equivariance (validity is preserved by name-swapping), and fresh name generation (“new” or fresh names can always be chosen). It is inspired by a particular class of models for abstract...

The aim of this paper is robust identification of smart foam, as an electroacoustic transducer, considering unmodeled dynamics due to nonlinearities in behaviour at low frequencies and measurement noise at high frequencies as existent uncertainties. Set membership estimation combined with model error modelling technique is used where the approach is based on worst case scenario with unknown but...

This paper presents a machine learning approach for identification of Bengali multiword expressions (MWE) which are bigram nominal compounds. Our proposed approach has two steps: (1) candidate extraction using chunk information and various heuristic rules and (2) training the machine learning algorithm called Random Forest to classify the candidates into two groups: bigram nominal compound MWE ...

The paper proposes a new frequency domain approach to the design of robust decentralized controllers (DC) for continuous-time systems described by a set of transfer function matrices. To guarantee the nominal stability and the prespecified nominal performance, the recently developed DC design technique (Kozáková and Veselý, 2003) has been applied, adapted so as to guarantee the robust M-∆  str...

Nominal unification calculates substitutions that make terms involving binders equal modulo alphaequivalence. Although nominal unification can be seen as equivalent to Miller’s higher-order pattern unification, it has properties, such as the use of first-order terms with names (as opposed to alphaequivalence classes) and that no new names need to be generated during unification, which set it cl...

This paper illustrates a way of using paraphrasal interpretation of English nominal compound for translating them into Hindi. Input Nominal compound is first paraphrased automatically with the 8 prepositions as proposed by Lauer (1995) for the task. English prepositions have one-to-one mapping to post-position in Hindi. The English paraphrases are then translated into Hindi using the mapping sc...

Recent theoretical work indicates that when firms set nominal prices in advance they are exposed to business cycle risk. Risk averse firms with market power may set relatively high markups over marginal cost to offset this risk. An appropriate monetary policy could reduce the risk of pre-set nominal prices. This paper uses industry-level panel data to estimate how the exchange rate regime affec...