We show that the separative quotient of the poset 〈P,⊂〉 of isomorphic suborders of a countable scattered linear order L is σ-closed and atomless. So, under the CH, all these posets are forcing-equivalent /Fin)+).

A maximal almost disjoint (mad) family $\mathscr{A} \subseteq [\omega]^\omega$ is Cohen-stable if and only if it remains maximal in any Cohen generic extension. Otherwise it is Cohen-unstable. It is shown that a mad family, A, is Cohen-unstable if and only if there is a bijection G from ω to the rationals such that the sets G[A], A ∈A are nowhere dense. An ℵ 0 -mad family, A, is a mad family with the property that given any countable family $\mathscr{B} \subset (...) [\omega]^\omega$ such that each element of B meets infinitely many elements of A in an infinite set there is an element of A meeting each element of B in an infinite set. It is shown that Cohen-stable mad families exist if and only if there exist ℵ 0 -mad families. Either of the conditions b = c or $\mathfrak{a} ) implies that there exist Cohen-stable mad families. Similar results are obtained for splitting families. For example, a splitting family, S, is Cohen-unstable if and only if there is a bijection G from ω to the rationals such that the boundaries of the sets G[S], S ∈S are nowhere dense. Also, Cohen-stable splitting families of cardinality ≤ κ exist if and only if ℵ 0 -splitting families of cardinality ≤ κ exist. (shrink)

We investigate the partial orderings of the form 〈P(X),⊂〉\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb{P}(\mathbb{X}), \subset \rangle}$$\end{document}, where X=〈X,ρ〉\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X} =\langle X, \rho \rangle }$$\end{document} is a countable binary relational structure and P(X)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} (\mathbb{X})}$$\end{document} the set of the domains of its isomorphic substructures and show that if the components of X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} (...) are maximally embeddable and satisfy an additional condition related to connectivity, then the poset 〈P(X),⊂〉\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb{P} (\mathbb{X}), \subset \rangle }$$\end{document} is forcing equivalent to a finite power of (P(ω)/ Fin)+, or to the poset (P(ω × ω)/(fin × Fin))+, or to the product (P(Δ)/EDfin)+×((P(ω)/Fin)+)n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(P(\Delta )/\fancyscript{e}\fancyscript{d}_{\rm fin})^+ \times ((P(\omega )/{\rm Fin})^+)^n}$$\end{document}, for some n∈ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \in \omega}$$\end{document}. In particular we obtain forcing equivalents of the posets of copies of countable equivalence relations, disconnected ultrahomogeneous graphs and some partial orderings. (shrink)

A structure ${\mathbb Y}$ of a relational language L is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $\,<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi $ of the linear order $\langle Y\setminus F, <\rangle $ the mapping $\mathop {\mathrm {id}}\nolimits _F \cup \varphi $ is a partial automorphism of ${\mathbb Y}$. By theorems of Fraïssé and Pouzet, an infinite structure ${\mathbb Y}$ is almost chainable iff the (...) profile of ${\mathbb Y}$ is bounded; namely, iff there is a positive integer m such that ${\mathbb Y}$ has $\leq m$ non-isomorphic substructures of size n, for each positive integer n. A complete first order L-theory ${\mathcal T}$ having infinite models is called almost chainable iff all models of ${\mathcal T}$ are almost chainable and it is shown that the last condition is equivalent to the existence of one countable almost chainable model of ${\mathcal T}$. In addition, it is proved that an almost chainable theory has either one or continuum many non-isomorphic countable models and, thus, the Vaught conjecture is confirmed for almost chainable theories. (shrink)

We establish the hierarchy among twelve equivalence relations on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities of their self-embedding monoids and intersections of these equivalence relations. In particular, fixing a language L and a cardinal κ, we consider the interplay between the restrictions of these similarities to the class ModL of all L-structures of size κ. It turns out that, concerning the number of different similarities and (...) the shape of the corresponding Hasse diagram, the class of all structures naturally splits into three parts: finite structures, infinite structures of unary languages, and infinite structures of non-unary languages. (shrink)

We study the partial orderings of the form ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb{P}, \subset\rangle}$$\end{document}, where X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} is a binary relational structure with the connectivity components isomorphic to a strongly connected structure Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} and P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} is the set of substructures of X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {X}}$$\end{document} isomorphic to X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}. We show that, for example, for a countable X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}, the poset ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb {P}, \subset\rangle}$$\end{document} is either isomorphic to a finite power of P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} or forcing equivalent to a separative atomless σ-closed poset and, consistently, to P/fin. In particular, this holds for each ultrahomogeneous structure X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} such that X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} or Xc\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}^{c}}$$\end{document} is a disconnected structure and in this case Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} can be replaced by an ultrahomogeneous connected digraph. (shrink)

A sequence x=xn:nω of elements of a complete Boolean algebra converges to a priori if lim infx=lim supx=b. The sequential topology τs on is the maximal topology on such that x→b implies x→τsb, where →τs denotes the convergence in the space — the a posteriori convergence. These two forms of convergence, as well as the properties of the sequential topology related to forcing, are investigated. So, the a posteriori convergence is described in terms of killing of tall ideals on ω, (...) and it is shown that the a posteriori convergence is equivalent to the a priori convergence iff forcing by does not produce new reals. A property of c.B.a.’s, satisfying -cc -cc and providing an explicit definition of the a posteriori convergence, is isolated. Finally, it is shown that, for an arbitrary c.B.a. , the space is sequentially compact iff the algebra has the property and does not produce independent reals by forcing, and that implies P is the unique sequentially compact c.B.a. in the class of Suslin forcing notions. (shrink)

If a˜cardinal κ1, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ0 and its new cofinality, ρ, is less than κ0, then, under some additional assumptions, each cardinal λ>κ1 less than cc/[κ1]<κ1) is collapsed to κ0 as well. If in addition N=M[f], where f : ρ→κ1 is an unbounded mapping, then N is a˜λ=κ0-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.

If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered.

According to [M.S. Kurilić, Cohen-stable families of subsets of the integers, J. Symbolic Logic 66 257–270], adding a Cohen real destroys a splitting family on ω if and only if is isomorphic to a splitting family on the set of rationals, , whose elements have nowhere dense boundaries. Consequently, implies the Cohen-indestructibility of . Using the methods developed in [J. Brendle, S. Yatabe, Forcing indestructibility of MAD families, Ann. Pure Appl. Logic 132 271–312] the stability of splitting families in (...) several forcing extensions is characterized in a similar way . Also, it is proved that a splitting family is preserved by the Sacks forcing if and only if it is preserved by some forcing which adds a new real. The corresponding hierarchy of splitting families is investigated. (shrink)

A complete Boolean algebra ${\mathbb{B}}$ satisfies property ${(\hbar)}$ iff each sequence x in ${\mathbb{B}}$ has a subsequence y such that the equality lim sup z n = lim sup y n holds for each subsequence z of y. This property, providing an explicit definition of the a posteriori convergence in complete Boolean algebras with the sequential topology and a characterization of sequential compactness of such spaces, is closely related to the cellularity of Boolean algebras. Here we determine the position of (...) property ${(\hbar)}$ with respect to the hierarchy of conditions of the form κ-cc. So, answering a question from Kurilić and Pavlović (Ann Pure Appl Logic 148(1–3):49–62, 2007), we show that ${``\mathfrak{h}{\rm -cc}\Rightarrow (\hbar)"}$ is not a theorem of ZFC and that there is no cardinal ${\mathfrak{k}}$ , definable in ZFC, such that ${``\mathfrak{k} {\rm -cc} \Leftrightarrow (\hbar)"}$ is a theorem of ZFC. Also, we show that the set ${\{ \kappa : {\rm each}\, \kappa{\rm -cc\, c.B.a.\, has}\, (\hbar ) \}}$ is equal to ${[0, \mathfrak{h})}$ or ${[0, {\mathfrak h}]}$ and that both values are consistent, which, with the known equality ${{\{\kappa : {\rm each\, c.B.a.\, having }\, (\hbar )\, {\rm has\, the}\, \kappa {\rm -cc } \} =[{\mathfrak s}, \infty )}}$ completes the picture. (shrink)

The game Gls(κ) is played on a complete Boolean algebra B, by two players. White and Black, in κ-many moves (where κ is an infinite cardinal). At the beginning White chooses a non-zero element p ∈ B. In the α-th move White chooses pα ∈ (0.p)p and Black responds choosing iα ∈ {0.1}. White wins the play iff $\bigwedge _{\beta \in \kappa}\bigvee _{\alpha \geq \beta }p_{\alpha}^{i\alpha}=0$ , where $p_{\alpha}^{0}=p_{\alpha}$ and $p_{\alpha}^{1}=p\ p_{\alpha}$ . The corresponding game theoretic properties of c.B.a.'s are (...) investigated. So. Black has a winning strategy (w.s) if κ ≥ π(B) or if B contains a κ -closed dense subset. On the other hand, if White has a w.s., then κ ∈ [h₂(B). π(B)). The existence of w.s. is characterized in a combinatorial way and in terms of forcing. In particular, if 2κ = κ ∈ Reg and forcing by B preserves the regularity of κ, then White has a w.s. iff the power 2κ is collapsed to κ in some extension. It is shown that, under the GCH, for each set S ⊆ Reg there is a c.B.a. B such that White (respectively. Black) has a w.s. for each infinite cardinal κ ∈ S (resp. κ ∉ S). Also it is shown consistent that for each κ ∈ Reg there is a c.B.a. on which the game Gls(κ) is undetermined. (shrink)

The game is played on a complete Boolean algebra in ω-many moves. At the beginning White chooses a non-zero element p of and, in the nth move, White chooses a positive pn

(...) positive Maharam submeasure or contains a countable dense subset, then Black has a winning strategy in the game played on . A Suslin algebra on which the game is undetermined is constructed and the game is compared with the well-known cut-and-choose games , and introduced by Jech. (shrink)

We investigate possible cardinalities of maximal antichains in the poset of copies \,\subseteq \rangle \) of a countable ultrahomogeneous relational structure \. It turns out that if the age of \ has the strong amalgamation property, then, defining a copy of \ to be large iff it has infinite intersection with each orbit of \, the structure \ can be partitioned into countably many large copies, there are almost disjoint families of large copies of size continuum and, hence, there are (...) antichains of size continuum in the poset \\). Finally, we show that the posets of copies of all countable ultrahomogeneous partial orders contain maximal antichains of cardinality continuum and determine which of them contain countable maximal antichains. That holds, in particular, for the generic poset. (shrink)

Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto nowhere (...) dense sets. If 2< κ =κ, then in each generic extension of V, in which κ is the minimal cardinal obtaining new subsets, some mad family on κ is killed or an independent subset of κ appears. Also, the κ-Suslin Hypothesis holds iff there exists a mad family on κ which is killed in each generic extension containing new subsets of κ and preserving P(λ) for λ<κ. (shrink)

A relational structure \ is called reversible iff each bijective homomorphism from \ onto \ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible structures of a given relational language L is to notice that the maximal or minimal elements of isomorphism-invariant sets of interpretations of the language L on a fixed domain X determine reversible structures. We isolate certain syntactical conditions providing that a satisfiable \-theory defines a class of interpretations (...) having extreme elements on a fixed domain and detect several classes of reversible structures. For some of these classes, we characterize the corresponding reversible extreme interpretations. In particular, we characterize the reversible countable ultrahomogeneous graphs. (shrink)

If κ is an infinite cardinal, a complete Boolean algebra B is called κ-supported if for each sequence 〈bβ : β αbβ = equation imagemath imageequation imageβ∈Abβ holds. Combinatorial and forcing equivalents of this property are given and compared with the other forcing related properties of Boolean algebras . The set of regular cardinals κ for which B is not κ-supported is investigated.

Connaissez-vous Daniel S. Milo? Il dit lui-même être « le seul témoin ici de [ses] propres exploits ». Il conviendrait donc de faire les présentations d’usage. Mais suffit-il de dire que l’homme est historien, romancier et philosophe, maître de conférences à l’École des hautes études en sciences sociales à Paris? Difficile, car malgré tout on en vient vite à s’écrier, sur le ton de parents excédés par l’insubordination de leur rejeton : « Qu’est-ce qu’il...

_ Source: _Volume 56, Issue 3-4, pp 241 - 271 William of Ockham and John Buridan provide different accounts of the distinction between formal and material consequences. Some consequences – in particular, enthymemes – that Ockham would classify as formal would be classified as material by Buridan. This paper explains this taxonomical discrepancy. It identifies the root of the discrepancy not in a difference between Ockham’s and Buridan’s notions of propositional hylomorphism but rather in Ockham’s endorsement of relational characterizations of (...) consequences. (shrink)

In this paper we will try to show the differences between Quine’s and Gibson’s interpretation of the naturalized epistemology project. Namely, although Gibson points out that the genetic approach advocated by Quine is the best strategy there is to investigate the relations between evidence and theory, and that externalizing of empiricism that it requires is one of Quine’s major philosophical contributions, we argue that the assumptions on which Gibson’s project is based, apart from the fact that they are in conflict (...) with some strongly held intuitions, would have to be essentially different from Quine’s. In other words, contrary to Quine’s position within which we have the possibility of staying on more moderate, and in our opinion, more plausible behavioristic line of approach, we will try to show that one of the consequences of Gibson’s interpretation is that this possibility is ruled out in Gibson’s case. On the other hand, this should enable us to draw some more radical conclusions about the nature of Quine’s epistemological project. (shrink)

This is a companion to a paper by the authors entitled “Gödel’s natural deduction,” which presented and made comments about the natural deduction system in Gödel’s unpublished notes for the elementary logic course he gave at the University of Notre Dame in 1939. In that earlier paper, which was itself a companion to a paper that examined the links between some philosophical views ascribed to Gödel and general proof theory, one can find a brief summary of Gödel’s notes for the (...) Notre Dame course. In order to put the earlier paper in proper perspective, a more complete summary of these interesting notes, with comments concerning them, is given here. (shrink)

In this paper, we will try to confront Quine’s and Davidson’s holistic position through Davidson’s thesis of the mental as a non-ontological category. In this regard, since Davidson came to this position through the thesis of the mental as a decidedly conceptual category, we will try to show how this approach does not, nevertheless, rule out the possibility of its interpretation in ontological terms. However, in what follows we will draw attention to the fact that the mental can be interpreted (...) so that it proves to be immune to ontologizing in Quine’s sense. This would be the evidence of different ways, which are not necessarily compatible, to argue for Davidson’s central thesis - the thesis about holistic character of the mental - as well as, which is closely related, a certain difference that exists between Davidson’s view of the mental as a conceptual category on the one hand, and a holistic category on the other. (shrink)

Here I reply to a recent exchange between Edgar Danielyan and Brian Garrett regarding Alvin Plantinga’s assessment of Gaunilo’s ‘ideal island’ objection to Anselm’s ontological argument. I argue that an ideal island is conceivable if it’s defined as any island exhibiting an ideal ratio of great-making island properties.

The subject of this paper is Charles Morris’ semiotic theory that has as one of its major projects the unification of all sciences of signs. However, since the above project has proven to be unsuccessful, we will try to examine here the reasons that led to this. Accordingly, we will argue that to transcend the particularities of individual disciplines that he wanted to unify, Morris had to make certain ontological assumptions, instead of theoretical and methodological ones, that they could share. (...) However, because the 'sign' as an ontological category could in our view only be established if we follow the principles of the pragmatic philosophical tradition, we will try to show that the reasons for this failure should be primarily sought in different effects that consistent application of the pragmatic principles has in each of them (primarily in linguistics and the philosophy of language). On the other hand, this should enable us to draw several important conclusions regarding Morris’ project: namely, that his failure does not have to mean giving up semiotics as a potentially key discipline in approaching some fundamental philosophical problems, but also that it would demand return to the original semiotics developed in Peirce’s works. (shrink)

This paper deals with Schaffer’s distinction between metaphysical structures, as well as his appeal for revival of neo-Aristotelian approaches that imply ordered structure, based on the criticism of Quine’s method that, in his view, implies flat metaphysical structure. However, although we believe that Schaffer’s distinction between metaphysical structures is an interesting and, basically, acceptable view, we will try to show that Schaffer’s arguments are not convincing enough to persuade us to abandon Quine’s method and adopt the Aristotelian metaphysical model. Moreover, (...) when mistakes that Schaffer makes are corrected and Quine’s method is given due attention, we will see that this can enable us a more tenable interpretation of the concepts that Schaffer speaks of (metaphysical structures), but also – as in his case – to draw certain conclusions that go beyond objectives of classification as such. (shrink)

This paper deals with Peirce’s understanding of perceptual judgment, relating it to the conditions for the use of language defined by Michael Dummett. Namely, drawing on Dummett’s requirement for harmony between descriptive and evaluative aspects of our linguistic practice, we will try to give an interpretation of Peirce’s view of perception that implies rejecting the idea that the formation of a perceptual judgment has an inferential structure. On the other hand, since it is, in Peirce’s opinion, the structure of abductive (...) inference, this approach should enable us to draw some conclusions related to abduction in general. (shrink)

Thomas Aquinas says that the eucharistic words of consecration – ‘This is my body’ (‘Hoc est corpus meum’) – are uttered by the consecrating priest both ‘significatively’ (‘significative’) and ‘recitatively’ (‘recitative’). This allows him to simultaneously account for the reference of the indexicals ‘this’ and ‘my’, the first of which must apply to some present substance, and the second of which must refer not to the priest but to Christ. This joint significative and recitative use can be distinguished from other (...) semantic and pragmatic features that the words exhibit, which I call significative productivity and instrumental representation: the words produce what they signify, and the speaker acts as an instrument of another, whom the speaker represents. Other sacramental forms share these features. What’s distinctive about the words of consecration is how they exhibit them – as a recitation. This recitative use can be explained by distinguishing between the sacramental gesture (such as the pouring of holy water or the anointing with oil) and the sacramental speech act (that is, the uttering of words that signify and produce the sacrament). In the eucharist, the sacramental gesture and sacramental speech act are one and the same. Despite identifying this intriguing linguistic phenomenon, Aquinas doesn’t fully explain. Puzzles linger, one of which concerns whether the recited words are also asserted. (shrink)

Paul Spade argues that there is a tension between Ockham’s descriptions of the various types of supposition at Summa Logicae I.64 and a rule he provides at sl I.65. In later papers, Spade proposes a solution: a term supposits significatively just in case it supposits for everything it signifies. I evaluate Spade’s proposal and explore some of its implications. I show that it successfully resolves the tension and that it suggests a way to more precisely describe material and simple supposition. (...) I argue furthermore that Ockham is committed to the proposal by showing that uncontroversial features of his theory imply it. In doing so, I raise and refute three potential objections. Finally, I highlight and discuss a controversial result: self-signifying conventional terms can supposit materially. I argue that this result makes for a more satisfying theory. (shrink)

Starting from the generalized concept of syntactically and semantically trivial differences between two formal theories introduced by Arsenijević, we show that two systems of the linear continuum, the Cantorian point-based system and the Aristotelian interval-based system that satisfies Cantor's coherence condition, are only trivially different. So, the 'great struggle' (to use Cantor's phrase) between the two contending parties turns out to be 'much ado about nothing'.

The talk deals with Aristotle’s famous sea-battle problem concerning the truth values of sentences about contingent future events: If an utterance of the sentence “There will be a sea battle tomorrow” is true, then it seems that it is determined that there will be a sea battle tomorrow. For otherwise, how could the utterance be true? If, however, an utterance of the sentence “There will be a sea battle tomorrow” is false, then it seems that it is determined that there (...) will be no sea battle tomorrow. For otherwise, how could the utterance be false? Thus, it seems that it is determined whether there will be a sea battle tomorrow or not – and so for any future event whatsoever. This, however, is in conflict with the assumption that there is such a thing as an open future, i.e., that at least for some future events, it is not determined whether they will take place or not. Some have argued, in light of this problem, that sentences about f uture events are neither true nor false. In this talk, however, it shall be argued that the sea-battle problem can be resolved in an intuitively plausible manner without giving up the principle of bivalence. (shrink)

In his article ‘Art and Time’ Patočka argues that Hegel rightly recognized a fundamental difference between classical and contemporary art. In developing Hegel’s insight he offers a conception of two eras of art, the ‘artistic’ era and the era of ‘aesthetic culture’. Patočka supposes that artworks of both the artistic era and the aesthetic era always open up a certain ‘meaning’ that gives human existence its fundamental points of reference. The status of this world, however, radically changed from one era (...) to the next. The art of the artistic era offered objective and binding meaning, whereas aesthetic art offers personal or individual meaning. The current article points to an important discrepancy in Patočka’s treatment of the relation between the two eras, and presents Patočka’s later reading of Hegel’s notion of the past character of art. From the perspective of this interpretation, art reveals temporality as such, that is, as the ontological basis of the revelation of meaning. The article emphasizes that such an interpretation demonstrates the ontological relevance of the artwork in greater detail. Yet Patočka continued to use the concepts of the artistic era and the aesthetic era, without sufficiently clarifying the relationship between the two eras. Finally, the author argues that the discrepancy in the concept can be resolved with the help of Patočka’s later reflections on the ‘problematic nature’ of meaning. The article argues that in classical art such a nature is concealed, whereas in modern art it is revealed again. The article includes an English translation of Patočka´s ‘Art and Time’. (shrink)