Inconsistencies of the Consistency test

The Consistency test from Dayal 2004—inspired by Löbner’s (1985) logical property of Consistency—has been used to distinguish between demonstratives and definite determiners in a language, particularly in a type-shifting analysis of bare nouns following Chierchia 1998 and Dayal 2004. This paper looks at three classifier languages, Nuosu Yi (Jiang 2018), Thai (Jenks 2015), and Shan (Moroney 2018) and examines the use of the Consistency test in the study of N/DP syntax and semantics. While the Consistency test can identify demonstratives from their ability to shift reference using deixis, it cannot identify when a nominal expression ‘counts’ as a definite determiner.

SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks

In this paper, we introduce the Satisfiability Modulo Theory (SMT) attack on obfuscated circuits. The proposed attack is the superset of Satisfiability (SAT) attack, with many additional features. It uses one or more theory solvers in addition to its internal SAT solver. For this reason, it is capable of modeling far more complex behaviors and could formulate much stronger attacks. In this paper, we illustrate that the use of theory solvers enables the SMT to carry attacks that are not possible by SAT formulated attacks. As an example of its capabilities, we use the SMT attack to break a recent obfuscation scheme that uses key values to alter delay properties (setup and hold time) of a circuit to remain SAT hard. Considering that the logic delay is not a Boolean logical property, the targeted obfuscation mechanism is not breakable by a SAT attack. However, in this paper, we illustrate that the proposed SMT attack, by deploying a simple graph theory solver, can model and break this obfuscation scheme in few minutes. We describe how the SMT attack could be used in one of four different attack modes: (1) We explain how SMT attack could be reduced to a SAT attack, (2) how the SMT attack could be carried out in Eager, and (3) Lazy approach, and finally (4) we introduce the Accelerated SMT (AccSMT) attack that offers significant speed-up to SAT attack. Additionally, we explain how AccSMT attack could be used as an approximate attack when facing SMT-Hard obfuscation schemes.

Was ist eine psychische Störung?

This article sets out key contributions to the long-running debate about mental disorder from the ordinary language philosophy of the ‘Oxford School’. The distinction between definition and use of concepts underpinning ordinary language philosophy reframes the debate as a debate not just about mental disorder but about disorder in general, bodily as well as mental. The field work of ordinary language philosophy (focusing on the use of concepts as a guide to their meanings) shows that, attempts at elimination notwithstanding, there is an essential evaluative element in the meaning of disorder, bodily as well as mental. The concept of disorder in the debate thus reframed presents a double challenge for analysis: to explain why disorder has evaluative connotations used of mental conditions but descriptive connotations used of bodily conditions. Philosophical value theory, derived by applying ordinary language philosophy to the language of values, provides a rich resource of ideas for meeting this double challenge. It meets the double challenge at the level of theory by allowing both aspects of the double challenge of disorder to be derived from a logical property that disorder shares with all other value terms. It meets the double challenge at the level of practice by supporting the development of a new approach to working with values alongside evidence in healthcare called values-based practice. Ordinary language philosophy, notwithstanding these several contributions, is no panacea. It helps us to make a start, no more and no less, in understanding mental disorder.

Wouldn't It Be Nice If p, Therefore, p (for a moral p)

Instances of the argument-schema ‘Wouldn't it be nice if p, therefore, p’ are usually fallacious, but for a moral p they are not clearly as bad as they are elsewhere. I offer a diagnosis of this phenomenon, arguing that in some conditions – specified in terms of a logical property of the relevant normative operator – such arguments are actually valid (for a moral p).