Results 1  10
of
9,983
Classical and Intuitionistic Models of Arithmetic
 NOTRE DAME J. FORMAL LOGIC
, 1996
"... Given a classical theory T, a Kripke structure K = (K,≤,(Aα)α∈K) is called Tnormal (or locally T) if for each α ∈ K, Aα is a classical model of T. It has been known for some time now, thanks to van Dalen, Mulder, Krabbe, and Visser, that Kripke models of HA over finite frames (K,≤) are locally PA. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Given a classical theory T, a Kripke structure K = (K,≤,(Aα)α∈K) is called Tnormal (or locally T) if for each α ∈ K, Aα is a classical model of T. It has been known for some time now, thanks to van Dalen, Mulder, Krabbe, and Visser, that Kripke models of HA over finite frames (K,≤) are locally PA
Axiomatic Classes of Intuitionistic Models
"... A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisim ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images
Intuitionistic Model Constructions and Normalization Proofs
, 1998
"... We investigate semantical normalization proofs for typed combinatory logic and weak calculus. One builds a model and a function `quote' which inverts the interpretation function. A normalization function is then obtained by composing quote with the interpretation function. Our models are just ..."
Abstract

Cited by 50 (7 self)
 Add to MetaCart
We investigate semantical normalization proofs for typed combinatory logic and weak calculus. One builds a model and a function `quote' which inverts the interpretation function. A normalization function is then obtained by composing quote with the interpretation function. Our models
The emotional dog and its rational tail: a social intuitionist approach to moral judgment
 Psychological Review
, 2001
"... This is the manuscript that was published, with only minor copyediting alterations, as: Haidt, J. (2001). The emotional dog and its rational tail: A social intuitionist approach to moral judgment. Psychological Review. 108, 814834 Copyright 2001, American Psychological Association To obtain a repr ..."
Abstract

Cited by 644 (20 self)
 Add to MetaCart
the hypothesis that moral reasoning does not cause moral judgment; rather, moral reasoning is usually a posthoc construction, generated after a judgment has been reached. The social intuitionist model is presented as an alternative to rationalist models. The model is a social model in that it de
Axiomatic Classes of Intuitionistic Models 1
"... Abstract: A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images ..."
Abstract
 Add to MetaCart
Abstract: A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
formulas can be modularly embedded into this linear logic setting. Programming examples taken from theorem proving, natural language parsing, and data base programming are presented: each example requires a linear, rather than intuitionistic, notion of context to be modeled adequately. An interpreter
Synthetic Differential Geometry: A Way to Intuitionistic Models of General Relativity in Toposes
, 1996
"... W.Lawvere in [4] suggested a approach to differential geometry and to others mathematical disciplines closed to physics, which allows to give definitions of derivatives, tangent vectors and tangent bundles without passages to the limits. This approach is based on a idea of consideration of all setti ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
numbers, but a some nondegenerate commutative ring R of a line type in E . In this work we shall show that SDG allows to develop a Riemannian geometry and write the Einstein's equations of a field on pseudoRiemannian formal manifold. This give a way for constructing a intuitionistic models
Classical Logic as Limit An intuitionistic model of ∆ 0 2maps using Parallel Computations
"... We propose a purely intuitionistic equational model N of ∆0 2maps. N is an informative model: if ∃x.P (x) istrueinN, we may intuitionistically deduce P (n) for some integer n. Integers are a dense subset N of N: if a property of the structure N is true for all x ∈ N, then it is true for all x ∈N. N ..."
Abstract
 Add to MetaCart
We propose a purely intuitionistic equational model N of ∆0 2maps. N is an informative model: if ∃x.P (x) istrueinN, we may intuitionistically deduce P (n) for some integer n. Integers are a dense subset N of N: if a property of the structure N is true for all x ∈ N, then it is true for all x ∈N
Intuitionistic dualintuitionistic nets
, 2009
"... The intuitionistic sequent calculus (at most one formula on the righthand side of sequents) comes with a natural dual system: the dualintuitionistic sequent calculus (at most one formula on the lefthand side). We explain how the duality between these two systems exactly corresponds to the intens ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The intuitionistic sequent calculus (at most one formula on the righthand side of sequents) comes with a natural dual system: the dualintuitionistic sequent calculus (at most one formula on the lefthand side). We explain how the duality between these two systems exactly corresponds
What is a Categorical Model of Intuitionistic Linear Logic?
, 1995
"... This paper readdresses the old problem of providing a categorical model for Intuitionistic Linear Logic (ILL). In particular we compare the now standard model proposed by Seely to the lesser known one proposed by Benton, Bierman, Hyland and de Paiva. Surprisingly we find that Seely's model is ..."
Abstract

Cited by 110 (5 self)
 Add to MetaCart
This paper readdresses the old problem of providing a categorical model for Intuitionistic Linear Logic (ILL). In particular we compare the now standard model proposed by Seely to the lesser known one proposed by Benton, Bierman, Hyland and de Paiva. Surprisingly we find that Seely's model
Results 1  10
of
9,983