Results 1  10
of
415
Impulses and Physiological States in Theoretical Models of Nerve Membrane
 Biophysical Journal
, 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract

Cited by 505 (0 self)
 Add to MetaCart
ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing
Modal Logics for Qualitative Spatial Reasoning
, 1996
"... Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate highlevel qualitative spatial information ..."
Abstract

Cited by 92 (12 self)
 Add to MetaCart
are known. 0order modal logics provide an alternative representation which is more expressive than classical 0order logic and yet often more amenable to automated deduction than 1storder formalisms. These calculi are usually interpreted as propositional logics: nonlogical constants are taken as denoting
The πcalculus as a theory in linear logic: Preliminary results
 3rd Workshop on Extensions to Logic Programming, LNCS 660
, 1993
"... The agent expressions of the πcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of πcalculus (unlabeled) reduction is identified with “entailedby”. Under this translation, parallel composition is mapped to the multiplicative disjunct ..."
Abstract

Cited by 113 (18 self)
 Add to MetaCart
disjunct (“par”) and restriction is mapped to universal quantification. Prefixing, nondeterministic choice (+), replication (!), and the match guard are all represented using nonlogical constants, which are specified using a simple form of axiom, called here a process clause. These process clauses
Syntactic Characteristics of Empirical Substructures —Summary—
"... I show that van Fraassen’s semantic conception of the relation theory and observation based on empirical substructures has a direct syntactic formulation and even formulations based on the bipartition of a theory’s vocabulary into theoretical and observational nonlogical constants. The direct synta ..."
Abstract
 Add to MetaCart
I show that van Fraassen’s semantic conception of the relation theory and observation based on empirical substructures has a direct syntactic formulation and even formulations based on the bipartition of a theory’s vocabulary into theoretical and observational nonlogical constants. The direct
A SCOPE THEORY OF TENSE AND ADNOMINAL MODIFIERS
"... In the tradition of formal semantics (e.g., Montague’s PTQ), tense morphemes are assumed to be sentential operators. For example, (1a) is analyzed as in (1b), where P is a past tense operator. (1) a. Every student left. b. P[∀x[student(x) → leaves(x)]] c. There is some past time t such that every s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. An important empirical prediction that this system makes is that P affects the temporal interpretation of each nonlogical constant in its scope. (1b) is interpreted as in (1c). In this case, P has scope over STUDENT and LEAVES. (1a) can also receive an interpretation that is symbolized as in (2a
The PiCalculus as a Theory in Linear Logic
, 1992
"... The agent expressions of the ßcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of ßcalculus (unlabeled) reduction is identified with "entailedby". Under this translation, parallel composition is mapped to the multiplicativ ..."
Abstract
 Add to MetaCart
to the multiplicative disjunct ("par") and restriction is mapped to universal quantification. Prefixing, nondeterministic choice ( ), replication (!), and the match guard are all represented using nonlogical constants, which are specified using a simple form of axiom, called here a process clause
The Power of a Propositional Constant
, 2012
"... Monomodal logic has exactly two maximally normal logics, which are also the only quasinormal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maxima ..."
Abstract
 Add to MetaCart
Monomodal logic has exactly two maximally normal logics, which are also the only quasinormal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many
Why the constant `undefined'?  Logics of partial terms for strict and nonstrict functional programming languages
 Journal of Functional Programming
, 1998
"... In this article we explain two di#erent operational interpretations of functional programs by two di#erent logics. The programs are simply typed #terms with pairs, projections, ifthenelse, and least fixed point recursion. A logic for callbyvalue evaluation and a logic for callbyname evaluation ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
byname evaluation are obtained as as extensions of a system which we call the basic logic of partial terms (BPT). This logic is suitable to prove properties of programs that are valid under both strict and nonstrict evaluation. We use methods from denotational semantics to show that the two extensions of BPT
FreeVariable Tableaux for ConstantDomain Quantified Modal Logics with Rigid and NonRigid Designation
, 2001
"... This paper presents a sound and complete freevariable tableau calculus for constantdomain quantified modal logics, with a propositional analytical basis, i.e. one of the systems K, D, T, K4, S4. The calculus is obtained by addition of the classical freevariable rule and the "liberalized&quo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents a sound and complete freevariable tableau calculus for constantdomain quantified modal logics, with a propositional analytical basis, i.e. one of the systems K, D, T, K4, S4. The calculus is obtained by addition of the classical freevariable rule and the "
Constants of Grammatical Reasoning
 Constraints and Resources in Natural Language Syntax and Semantics
, 1999
"... This is a screen version, enhanced with some dynamic features, of the paper that has appeared under the same title in Bouma, Hinrichs, Kruij# & Oehrle (eds.) Constraints and Resources in Natural Language Syntax and Semantics. CSLI, Stanford, 1999. You can use the # and # keys to move through ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
through the document. The # sign at the bottom of the screen brings you back from a hyperlink. Contents # Contents 1 Cognition = computation, grammar = logic . . . . . . . . . . . . . . . . . . 4 1.1 Grammatical resources . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.1.1 Composition
Results 1  10
of
415