共查询到20条相似文献,搜索用时 625 毫秒
1.
Hagit Benbaji 《Acta Analytica》2008,23(1):55-67
Two-dimensional semantics aims to eliminate the puzzle of necessary a posteriori and contingent a priori truths. Recently
many argue that even assuming two-dimensional semantics we are left with the puzzle of necessary and a posteriori propositions.
Stephen Yablo (Pacific Philosophical Quarterly, 81, 98–122, 2000) and Penelope Mackie (Analysis, 62(3), 225–236, 2002) argue that a plausible sense of “knowing which” lets us know the object of such a proposition, and yet its necessity is
“hidden” and thus a posteriori. This paper answers this objection; I argue that given two-dimensional semantics you cannot
know a necessary proposition without knowing that it is true.
相似文献
Hagit BenbajiEmail: |
2.
S. Verwulgen 《Applied Categorical Structures》2007,15(5-6):647-653
It is well-known (see Semadeni, Queen Pap. Pure Appl. Math., 33:1–98, 1973 and Pumplün and Röhrl, Commun. Algebra, 12(8):953–1019, 1984, 1985) that the embedding of vector spaces into the category of absolutely convex modules is reflective. As we will show, under a separatedness condition on these modules it is at the same time coreflective. This is a peculiar situation, see Kannan, Math. Ann., 195:168–174, (1972) and Hu $\textrm {\u{s}}It is well-known (see Semadeni, Queen Pap. Pure Appl. Math., 33:1–98, 1973 and Pumplün and R?hrl, Commun. Algebra, 12(8):953–1019, 1984, 1985) that the embedding of vector spaces into the category of absolutely convex modules is reflective. As we will show, under
a separatedness condition on these modules it is at the same time coreflective. This is a peculiar situation, see Kannan,
Math. Ann., 195:168–174, (1972) and Huek, Reflexive and coreflexive subcategories of unif and top, Seminar Uniform Spaces, Prague, 113–126, (1973), but we do find it also in the embedding (Lowen, Approach Spaces: The Missing Link in the Topology-Uniformity-Metric Triad. Oxford Mathematical Monographs, Oxford
University Press, London, UK, 1997) and, by extension, in the embedding (see Lowen and Verwulgen, Houst. J. Math, 30(4):1127–1142, 2004, and Sioen and Verwulgen, Appl. Gen. Topol., 4(2):263–279, 2003. We demonstrate that, in this setting, by duality arguments, absolutely convex modules are indeed the numerical counterpart
of vector spaces. All these, at first sight unrelated facts, are comprised in the commutative scheme below with natural dualisation
functors and their left adjoints.
相似文献
3.
Simon Rodan 《Computational & Mathematical Organization Theory》2008,14(3):222-247
Earlier theoretical accounts of collective learning relied on rules and operating procedures as the organizational memory
(March in Organ. Sci. 2(1):71–87, 1991; Rodan in Scand. J. Manag. 21:407–428, 2005). This paper builds on this tradition drawing on ideas from social network theory. Learning is modeled as a social-psychological
process (Darr and Kurtzberg in Organ. Behav. Hum. Decis. Process. 82(1):28–44, 2000; Rulke et al. in Organ. Behav. Hum. Decis. Process. 82(1):134–149, 2000), in which organizations learn by exchanging information internally between their members (Argote et al. in Organ. Behav.
Hum. Decis. Process. 82(1):1–8, 2000; Carley in Am. Soc. Rev. 56(3):331–354, 1991; Carley in Soc. Perspect. 48(4):547–571, 1995). Learning is also characterized as stochastic and creative (Gruenfeld et al. in Organ. Behav. Hum. Decis. Process. 82(1):45–59,
2000). This model is used to explore predictions about the effect social networks have on idea generation and learning and alternative
strategies for choosing from whom to seek information.
相似文献
Simon RodanEmail: |
4.
In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence
operations of the type Cn
+ that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive
system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn
− that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false)
sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka
4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn
+ and Cn
− can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized
in two ways by the following triple:
${ll}{\rm by\,the\,triple}:\hspace{1.4cm}
(+ , -)\hspace{0,6cm} 5.
Choonkil Park 《Acta Appl Math》2008,102(1):71-85
This paper is a survey on the Hyers–Ulam–Rassias stability of the following Cauchy–Jensen functional equation in C
*-algebras:
6.
G. C. Calafiore 《Journal of Optimization Theory and Applications》2009,143(2):405-412
In this note, we derive an exact expression for the expected probability V of constraint violation in a sampled convex program (see Calafiore and Campi in Math. Program. 102(1):25–46, 2005; IEEE Trans. Autom. Control 51(5):742–753, 2006 for definitions and an introduction to this topic):
|