Results 111 to 120 of about 85,558 (251)
Noûs, Volume 59, Issue 1, Page 160-190, March 2025.Abstract Much has been written on whether practical knowledge (knowledge‐how) reduces to propositional knowledge (knowledge‐that). Less attention has been paid to what we call deliberative knowledge (knowledge‐to), i.e., knowledge ascriptions embedding other infinitival questions, like where to meet, when to leave, and what to bring.
Ethan Jerzak, Alexander W. Kocurek
wiley +1 more source
, 2005 In this paper we present a solution to the long-standing problem of characterising the coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process algebra. In fact, we present two distinct characterisations, which give rise
Rensink, Arend, Vogler, W.
core +2 more sources
On the Semantics and the Ontology of the Mass‐Count Distinction
Philosophy Compass, Volume 20, Issue 3, March 2025.ABSTRACT The mass‐count distinction is a morpho‐syntactic distinction among nouns in English and many other languages. Tree, chair, person, group, and portion are count nouns, which come with the plural and accept numerals such as one and first; water, rice, furniture, silverware, and law enforcement are mass nouns, which lack the plural and do not ...
Friederike Moltmann
wiley +1 more source
Semantics out of context: nominal absolute denotations for first-order logic and computation [PDF]
arXiv, 2013 Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of lattice-based, sets-based, and algebraic absolute semantics to first-order logic.
arxiv
Pidgin English proverbs as a source of structural nativization in Nigerian English
World Englishes, Volume 44, Issue 1-2, Page 166-183, March-June 2025.Abstract In this paper, we explore the role of Nigerian Pidgin English (NPE) proverbs in language contact settings and their impact on the development of idiomatic phraseology in Nigerian English (NgE). In a set of 100 NPE proverbs, we identified lexical keywords that served as anchors for searches in the large‐scale Nairaland corpus to detect ...
Marcus Callies, Folajimi Oyebola
wiley +1 more source
Facilitating modular property-preserving extensions of programming languages [PDF]
, 1998 We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on the core. Language features can be described separated from each other in
Pahl, Claus
core +1 more source
Applying quantitative semantics to higher-order quantum computing [PDF]
arXiv, 2013 Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the language to an unusably small finitary fragment, or giving up important features of quantum physics such as ...
arxiv
Are "Undocumented Workers" the Same as "Illegal Aliens"? Disentangling Denotation and Connotation in Vector Spaces [PDF]
arXiv, 2020 In politics, neologisms are frequently invented for partisan objectives. For example, "undocumented workers" and "illegal aliens" refer to the same group of people (i.e., they have the same denotation), but they carry clearly different connotations. Examples like these have traditionally posed a challenge to reference-based semantic theories and led to
arxiv
Models for CSP with availability information
, 2010 We consider models of CSP based on recording what events are available as possible alternatives to the events that are actually performed. We present many different varieties of such models.
Andrews +5 more
core +2 more sources
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs [PDF]
, 2014 We extract a novel quantum programming paradigm - superposition of programs - from the design idea of a popular class of quantum algorithms, namely quantum walk-based algorithms.
Feng, Yuan, Ying, Mingsheng, Yu, Nengkun
core