Can conjunctive propositions be identical without their conjuncts being identical? Can universally quantified propositions be identical without their instances being identical? On a common conception of propositions, on which they inherit the logical structure of the sentences which express them, the answer is negative both times. Here, it will be shown that such a negative answer to both questions is inconsistent, assuming a standard type-theoretic formalization of theorizing about propositions. The result is not specific to conjunction and universal quantification, but (...) applies to any binary operator and propositional quantifier. It is also shown that the result essentially arises out of giving a negative answer to both questions, as each negative answer is consistent by itself. (shrink)

This paper presents a learning theory pertinent to dynamic decision making (DDM) called instancebased learning theory (IBLT). IBLT proposes five learning mechanisms in the context of a decision‐making process: instance‐based knowledge, recognition‐based retrieval, adaptive strategies, necessity‐based choice, and feedback updates. IBLT suggests in DDM people learn with the accumulation and refinement of instances, containing the decision‐making situation, action, and utility of decisions. As decision makers interact with a dynamic task, they recognize a situation according to its similarity to past (...) instances, adapt their judgment strategies from heuristic‐based to instance‐based, and refine the accumulated knowledge according to feedback on the result of their actions. The IBLT's learning mechanisms have been implemented in an ACT‐R cognitive model. Through a series of experiments, this paper shows how the IBLT's learning mechanisms closely approximate the relative trend magnitude and performance of human data. Although the cognitive model is bounded within the context of a dynamic task, the IBLT is a general theory of decision making applicable to other dynamic environments. (shrink)

The distinction between singular and multiple artworks is usually drawn modally in terms of the notion of an ‘instance’ of a work. Singular works, it is claimed, can only have a single instance, whereas multiple works allow of more than one instance. But this is enlightening only if we have a clear idea of what is meant by an ‘instance’. I argue that there are two different notions of a work's ‘instances’ in play in the literature (...) – what I term its ‘provenential instances’ (‘P-instances’) and its ‘purely epistemic instances’ (E-instances). I further argue that these notions are conflated in the literature critical of Gregory Currie's ‘instance multiplicity hypothesis’ (IMH) – the claim that all artworks are multiple in nature. I defend a modified version of the IMH as a claim about a work's E-instances against a range of criticisms. (shrink)

This article argues how one problem of computing lies in realizing a significant instance given a class or type. Analysis of a case study on digital narrative suggests two general processes for instantiating significant instances: interaction and optimization. The article then explains how the problem of universals needs to be deconstructed when trying to understand what type of entities significant instances are and what the process for obtaining them is.

The consensus is that novels can be fully appreciated only through an experiential engagement with their well-formed instances. But what are the entities that serve as such instances? According to the orthodox view, these entities are primarily inscriptions—concrete texts written or printed on something or displayed on the screen of some electronic device. In this paper, I argue that this view is misguided, since well-formed instances of a novel must manifest certain sonic properties, but such properties cannot be manifested by (...) inscriptions. As an alternative, I put forward the view that the entities that serve as well-formed instances of novels are readings and sums of readings and graphic elements. (shrink)

In this paper, I examine a puzzle that emerges from what J. P. Moreland has called the traditional realist view of quality instances. Briefly put, the puzzle is to figure out how quality instances fit into the overall structure of a concrete particular, given that the traditional realist view of quality instances prima facie seems incompatible with what might be called the traditional realist view of concrete particulars. After having discussed the traditional realist views involved and the puzzle that emerges (...) from their juxtaposition, I propose an alternative realist view of quality instances which resolves the puzzle. In short, the puzzle is solved by treating the distinction between a concrete particular and its quality instances as a distinction of reason, and by adopting the view that the individuating element of a concrete particular must also serve as its unifying element – a view which Moreland, one of traditional realism’s most stalwart contemporary defenders, rejects. (shrink)

The Relevance Criterion of confirmation gained prominence as the underlying principle of the class-size approach (CSA) to Hempel's paradoxes of confirmation. The CSA, however, yields counter-intuitive results for (c) instances, and this failing cast serious doubt on the acceptability of the Relevance Criterion. In this paper an attempt is made to rescue the Relevance Criterion from this embarrassment. This is done by incorporating that criterion into a new resolution of the paradoxes, a resolution based on a theory of selective confirmation (...) and a distinction between mere confirmation in principle and evaluative confirmation (E-confirmation). (shrink)

In this article, we examine the advantages of simple metacognitive capabilities in a repeated social dilemma. Two types of metacognitive agent were developed and compared with a non-metacognitive agent and two fixed-strategy agents. The first type of metacognitive agent takes the perspective of the opponent to anticipate the opponent's future actions and respond accordingly. The other metacognitive agent predicts the opponent's next move based on the previous moves of the agent and the opponent. The modeler agent achieves better individual outcomes (...) than a non-metacognitive agent and is more successful at encouraging cooperation. The opponent-perspective agent, by contrast, fails to achieve these outcomes because it lacks important information about the opponent. These simple agents provide insights regarding modeling of metacognition in more complex tasks. (shrink)

Francis Bacon’s method of induction is often understood as a form of eliminative induction. The idea, on this interpretation, is to list the possible formal causes of a phenomenon and, by reference to a copious and reliable natural history, to falsify all of them but one. Whatever remains must be the formal cause. Bacon’s crucial instances are often seen as the crowning example of this method. In this article, I argue that this interpretation of crucial instances is mistaken, and it (...) has caused us to lose sight of why Bacon assigns crucial instances a special role in his quest for epistemic certainty about formal causes. If crucial instances are interpreted eliminatively, then they are subject to the two problems related to underdetermination raised by Duhem: (1) that it is impossible to be certain one has specified all of the possible alternatives and (2) that an experiment falsifies a whole theory, not just a single hypothesis in isolation. I show that Bacon anticipates and aims to dodge both of these problems by conceiving of crucial instances as working, in the ideal case, through direct affirmations that are supported by links to more foundational knowledge. (shrink)

Page's definition of localism is inspired by the instance-based paradigm. However, the locality of representations is not necessary for a model to be instance-based and, on the other hand, explicit featural representations are generally considered local. The important distinction is between instance-based and noninstance-based paradigms and not between distributed and local representations as Page claims.

An ontology's theory of ontic predication has implications for the concomitant predicate logic. Remarkable in its analytic power for both ontology and logic is the here developed Particularized Predicate Logic (PPL), the logic inherent in the realist version of the doctrine of unit or individuated predicates. PPL, as axiomatized and proven consistent below, is a three-sorted impredicative intensional logic with identity, having variables ranging over individuals x, intensions R, and instances of intensions $R_{i}$ . The power of PPL is illustrated (...) by its clarification of the self-referential nature of impredicative definitions and its distinguishing between legitimate and illegitimate forms. With a wellmotivated refinement on the axiom of comprehension, PPL is, in effect, a higher-order logic without a forced stratification of predicates into types or the use of other ad hoc restrictions. The Russell-Priest characterization of the classic self-referential paradoxes is used to show how PPL diagnosis and solves these antimonies. A direct application of PPL is made to Grelling's Paradox. Also shown is how PPL can distinguish between identity and indiscernibility. (shrink)

This article sketches a commonplace yet neglected epistemic puzzle raised by the diversity of our film-viewing practices. Because our appreciative practices allow for variability in the " instances " of cinematic works we engage, many of our experiential encounters with those works are flawed or impoverished in a number of ways. The article outlines a number of ways in which instances of cinema can vary – including, for example, in terms of color, score, and aspect ratio. This variability of instances (...) of cinema and, hence, the variability in our experiences of a cinematic work raise potential problems around normative questions of interpretation and evaluation. (shrink)

In the 1960s and 70s, first Lacan and then Althusser invoked the category of instance, in a way which would mark what is today called the «structuralist moment» of French philosophy, profoundly influencing the discourse of those who were the disciples of both. The complex system of references to action, demand, insistence, effectivity, decision, hierarchy, which found themselves combined in the notion, proves difficult to translate into other languages, and in particular into English (which has today become the paramount (...) language of critical theory). In order to achieve a syncretism of three heritages (Marx, Freud, Saussure), the French theorists drew on the polysemic extension of the word «instance», which while it does exist in English, operates differently. Hence the interest in examining the divergent choices made by the English and American translators, reading them as symptoms of certain tensions and of a logical instability which affect, from within, the «structuralist» paradigm à la française. (shrink)

I present an argument for the view that laws ground their instances. I then outline two important consequences that follow if we accept the conclusion of this argument. First, the claim that laws ground their instances threatens to undermine a prominent recent attempt to make sense of the explanatory power of Humean laws by distinguishing between metaphysical and scientific explanation. And second, the claim that laws ground their instances gives rise to a novel argument against the view that grounding relations (...) are metaphysically necessary. (shrink)

. Network data analysis helps in capturing node usage behavior. Existing algorithms use reduced feature set to manage high runtime complexity. Ignoring features may increase classification errors. This paper presents a model, allowing classification of network traffic, while considering all the relevant features. Learning phase partitions training sample on values of the respective features. This creates equivalence classes related to m features. During classification, each feature value of the test instance results in picking one set from equivalence class generated (...) during learning. Algorithm captures new behavior in semi-supervised incremental learning mode. For problems having m features and n training samples the model has incremental learning complexity of and average classification complexity is of the order. (shrink)

Suppose λ > κ is measurable. We show that if κ is either indestructibly supercompact or indestructibly strong, then A = {δ < κ | δ is measurable, yet δ is neither δ + strongly compact nor a limit of measurable cardinals} must be unbounded in κ. The large cardinal hypothesis on λ is necessary, as we further demonstrate by constructing via forcing two models in which ${A = \emptyset}$ . The first of these contains a supercompact cardinal κ and (...) is such that no cardinal δ > κ is measurable, κ’s supercompactness is indestructible under κ-directed closed, (κ +, ∞)-distributive forcing, and every measurable cardinal δ < κ is δ + strongly compact. The second of these contains a strong cardinal κ and is such that no cardinal δ > κ is measurable, κ’s strongness is indestructible under < κ-strategically closed, (κ +, ∞)-distributive forcing, and level by level inequivalence between strong compactness and supercompactness holds. The model from the first of our forcing constructions is used to show that it is consistent, relative to a supercompact cardinal, for the least cardinal κ which is both strong and has its strongness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing to be the same as the least supercompact cardinal, which has its supercompactness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing. It further follows as a corollary of the first of our forcing constructions that it is possible to build a model containing a supercompact cardinal κ in which no cardinal δ > κ is measurable, κ is indestructibly supercompact, and every measurable cardinal δ < κ which is not a limit of measurable cardinals is δ + strongly compact. (shrink)

Starting from cardinals κ κ is measurable, we construct a model for the theory “ZF + n < ω[DCn] + ω + 1 is a measurable cardinal”. This is the maximum amount of dependent choice consistent with the measurability of ω + 1, and by a theorem of Shelah using p.c.f. theory, is the best result of this sort possible.

Decision trees learning is one of the most practical classification methods in machine learning, which is used for approximating discrete-valued target functions. However, they may overfit the training data, which limits their ability to generalize to unseen instances. In this study, we investigated the use of instance reduction techniques to smooth the decision boundaries before training the decision trees. Noise filters such as ENN, RENN, and ALLKNN remove noisy instances while DROP3 and DROP5 may remove genuine instances. Extensive empirical (...) experiments were conducted on 13 benchmark datasets from UCI machine learning repository with and without intentionally introduced noise. Empirical results show that eliminating border instances improves the classification accuracy of decision trees and reduces the tree size, which reduces the training and classification times. In datasets without intentionally added noise, applying noise filters without the use of the built-in Reduced Error Pruning gave the best classification accuracy. ENN, RENN, and ALLKNN outperformed decision trees learning without pruning in 9, 9, and 8 out of 13 datasets, respectively. The datasets reduced using ENN and RENN without built-in pruning were more effective when noise was intentionally introduced in different ratios. (shrink)

We give three counterexamples to the folklore claim that in an arbitrary theory, if a complete type p over a set B does not divide over $C\subseteq B$, then no extension of p to a complete type over $\operatorname {acl}(B)$ divides over C. Two of our examples are also the first known theories where all sets are extension bases for nonforking, but forking and dividing differ for complete types (answering a question of Adler). One example is an $\mathrm {NSOP}_1$ theory (...) with a complete type that forks, but does not divide, over a model (answering a question of d’Elbée). Moreover, dividing independence fails to imply M-independence in this example (which refutes another folklore claim). In addition to these counterexamples, we summarize various related properties of dividing that are still true. We also address consequences for previous literature, including an earlier unpublished result about forking and dividing in free amalgamation theories, and some claims about dividing in the theory of generic $K_{m,n}$ -free incidence structures. (shrink)

This paper is about the question of whether or not virtual rape should be considered a crime under current law. A virtual rape is the rape of an avatar in a virtual world. In the future, possibilities for virtual rape of a person him- or herself will arise in virtual reality environments involving a haptic device or robotics. As the title indicates, I will study both these present and future instances of virtual rape in light of three categories of legal (...) philosophical theories on rape in order to answer the aforementioned question. I will argue that a virtual rape in a future virtual reality environment involving a haptic device or robotics should in principle count as the crime of rape; for it corresponds to rape as it is viewed under the liberal theories that currently dominate the law. A surprising finding will be that a virtual rape in a virtual world re-actualizes the conservative view of rape that used to dominate the law in the Middle Ages and resembles rape as it is viewed under the feminist theories that criticize current law. Virtual rape in a virtual world cannot count as rape under current law; however, and at the end of this paper, I will suggest qualifying it as sexual harassment instead. (shrink)

Normal 0 false false false MicrosoftInternetExplorer4 st1:*{behavior:url(#ieooui) } /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} The article analyzes the relationship between the dominant Churches from Hungary, Poland and Romania and the opposition to Communist regimes. The Churches – seen as institutional actors of civil society – are analyzed in terms of their material and symbolic resources which may act as prerequisites for the (...) initiation or support of oppositional activities. The relation of accommodation between the Church and the Communist regimes installed in the three countries are also analysed comparatively. The analysis follows the politically significant behaviour of the three Churches and the corresponding attitudes and measures developed by the Communist authorities. The article discusses Poland as the only case where the Church has been actively involved, on multiple levels, in oppositional activities. The distinctive feature in the Polish case is given by the complex ties developed by the Church with the remaining actors of the anti-Communist opposition, as well as by the enduring presence of religious imagery within the Polish society. Hungary and Romania displayed only a modest activity in the direction of religion-based opposition, being marked by isolated acts of defiance from individual members of the clergy in the context of an overall passivity of the Churches. (shrink)

Attention has been drawn, particularly since Kant, to propositions which can not have negative instances. They used to be called a priori, axioms, first principles. Today, they are usually called postulates—C. I. Lewis uses both the old and new terminology—because there is a growing recognition of the fact that at least some of them are not “necessary” in the traditional sense. Kant placed a limitation on the apriorism of the continental rationalists. Current epistemologists and logicians have outstripped Kant in the (...) direction signalled by him. Both he and they, however, concur in the opinion that apriori propositions are subject to negation of a sort. The Kantian dinge-an-sich, though they can not contradict these propositions by being negative instances of them, do nevertheless stand to them in the relation of insubordination, thereby exerting on them a “negative action” of a sort. And, according to current views, there are instances which, though they fall outside the range of significance of a proposition or system and hence can not contradict it, do nevertheless tend to bring about a revision of it by a negative action of some sort. The purpose of this brief essay is to coin a convenient name for such instances and to describe certain properties of their peculiar negative action. (shrink)

We present an improved method for clustering in the presence of very limited supervisory information, given as pairwise instance constraints. By allowing instance-level constraints to have spacelevel inductive implications, we are able to successfully incorporate constraints for a wide range of data set types. Our method greatly improves on the previously studied constrained -means algorithm, generally requiring less than half as many constraints to achieve a given accuracy on a range of real-world data, while also being more robust (...) when over-constrained. We additionally discuss an active learning algorithm which increases the value of constraints even further. (shrink)

According to C. S. Peirce, resemblance or similarity is the basis for the relationship of iconic signs to their dynamical objects. But what is the basis of resemblance or similarity itself and how is the phenomenon of iconicity generated? How does it function in cultural practices and processes by which various forms of signs are generated (say, for example, the cartographical procedures by which maps are drawn, more generally, the diagrammatic ones by which networks of relationships are iconically represented)? To (...) what extent are they themselves performances (maps are always both the result of mappings andthe impetus for re-mappings)? With examples from texts by Virginia Woolf, W. G. Sebald and Reif Larsen, I will argue that literary texts provide us with uniqueresources for exploring, among other matters, the performative dimension of iconicity in the complex interaction among icon, index and metaphor as aprerequisite for semiosis, the generation of signs. (shrink)

According to C. S. Peirce, resemblance or similarity is the basis for the relationship of iconic signs to their dynamical objects. But what is the basis of resemblance or similarity itself and how is the phenomenon of iconicity generated? How does it function in cultural practices and processes by which various forms of signs are generated (say, for example, the cartographical procedures by which maps are drawn, more generally, the diagrammatic ones by which networks of relationships are iconically represented)? To (...) what extent are they themselves performances (maps are always both the result of mappings andthe impetus for re-mappings)? With examples from texts by Virginia Woolf, W. G. Sebald and Reif Larsen, I will argue that literary texts provide us with uniqueresources for exploring, among other matters, the performative dimension of iconicity in the complex interaction among icon, index and metaphor as aprerequisite for semiosis, the generation of signs. (shrink)

Paul Horwich (1990) once suggested restricting the T-Schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory---that Naïve Comprehension should be restricted according to consistency maxims---has recently been defended by Laurence Goldstein (2006; 2013). It can be traced back to W.V.O. Quine(1951), who held that Naïve Comprehension embodies the only really intuitive conception of set (...) and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who,according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contra-diction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, anduse it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naïve Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine and perhaps Zermelo is untenable. (shrink)

According to C. S. Peirce, resemblance or similarity is the basis for the relationship of iconic signs to their dynamical objects. But what is the basis of resemblance or similarity itself and how is the phenomenon of iconicity generated? How does it function in cultural practices and processes by which various forms of signs are generated (say, for example, the cartographical procedures by which maps are drawn, more generally, the diagrammatic ones by which networks of relationships are iconically represented)? To (...) what extent are they themselves performances (maps are always both the result of mappings andthe impetus for re-mappings)? With examples from texts by Virginia Woolf, W. G. Sebald and Reif Larsen, I will argue that literary texts provide us with uniqueresources for exploring, among other matters, the performative dimension of iconicity in the complex interaction among icon, index and metaphor as aprerequisite for semiosis, the generation of signs. (shrink)