Results 1  10
of
3,669
How algebraic Bethe ansatz works for integrable model
 In: Symétries quantiques (Les Houches
, 1996
"... In my Les–Houches lectures of 1982 I described the inverse scattering method of solving the integrable field–theoretical models in 1+1 dimensional space–time. Both classical case, stemming from the famous paper by Gardner, Green, Kruskal and Miura of 1967 on KdV equation, and its quantum counterpart ..."
Abstract

Cited by 273 (4 self)
 Add to MetaCart
In my Les–Houches lectures of 1982 I described the inverse scattering method of solving the integrable field–theoretical models in 1+1 dimensional space–time. Both classical case, stemming from the famous paper by Gardner, Green, Kruskal and Miura of 1967 on KdV equation, and its quantum counterpart, developed mostly by
Interpolation and Beth Definability over the Minimal Logic
"... Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Wellcomposed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described. It is p ..."
Abstract
 Add to MetaCart
Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Wellcomposed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
at most k . 'Invariance for kpartial isomorphism' means having the same truth value at tuples of objects in any two models that are connected by a partial isomorphism in such a set. The precise sense of this is spelt out in the following proof. 21 Proof (Outline.) kvariable formulas
Hybrid Logics: Characterization, Interpolation and Complexity
 Journal of Symbolic Logic
, 1999
"... Hybrid languages are expansions of propositional modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work (for example [BS98, BT98a, BT99]) has focussed on a more constrained system called H(#; @). We sho ..."
Abstract

Cited by 109 (37 self)
 Add to MetaCart
Hybrid languages are expansions of propositional modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work (for example [BS98, BT98a, BT99]) has focussed on a more constrained system called H(#; @). We
The ProofTheory and Semantics of Intuitionistic Modal Logic
, 1994
"... Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary metatheory of informal classical mathematics. If, however, the same semantic definitions are interpret ..."
Abstract

Cited by 130 (0 self)
 Add to MetaCart
Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary metatheory of informal classical mathematics. If, however, the same semantic definitions
Computations in Propositional Logic
, 1996
"... c fl 1996 by Lex Hendriks Contents Dankwoord 1 1 General Introduction 3 1.1 Outline of the thesis : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1.2 General preliminaries : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 2 Semantic Types and Exact Models 15 2.1 Introduction : : : ..."
Abstract
 Add to MetaCart
c fl 1996 by Lex Hendriks Contents Dankwoord 1 1 General Introduction 3 1.1 Outline of the thesis : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1.2 General preliminaries : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 2 Semantic Types and Exact Models 15 2.1 Introduction
SELECTION AND INFORMATION: A CLASSBASED APPROACH TO LEXICAL RELATIONSHIPS
, 1993
"... Selectional constraints are limitations on the applicability of predicates to arguments. For example, the statement “The number two is blue” may be syntactically well formed, but at some level it is anomalous — BLUE is not a predicate that can be applied to numbers. According to the influential theo ..."
Abstract

Cited by 269 (9 self)
 Add to MetaCart
theory of (Katz and Fodor, 1964), a predicate associates a set of defining features with each argument, expressed within a restricted semantic vocabulary. Despite the persistence of this theory, however, there is widespread agreement about its empirical shortcomings (McCawley, 1968; Fodor, 1977
Results 1  10
of
3,669