Mental files and metafictive utterances

Metafictive utterances raise a kind of intuitions (intuitions of truthfulness) that pose a problem for a view that combines a referentialist approach to proper names with an antirealist stance on fictional characters. In this article I attempt to provide a solution to this problem within the framework of mental files. According to my position, metafictive utterances literally express an incomplete proposition while pragmatically conveying a complete one, which accounts for the intuitions of truthfulness. The proposition pragmatically conveyed is 'metarepresentational', I'll argue, in the sense that it is about a mental representation or mental file.As emissões metafictivas despertam intuições de verdade, as quais representam um problema para uma teoria que combine uma posição referencialista quanto aos nomes próprios com um compromisso antirrealista quanto às personagens de ficção. O objetivo deste artigo é proporcionar uma solução para este problema no âmbito da teoria de arquivos mentais. De acordo com a posição desenvolvida, enquanto as emissões metafictivas expressam literalmente uma proposição incompleta, comunicam pragmaticamente uma proposição completa, a qual explica as intuições de verdade. A proposição pragmaticamente comunicada, argumentarei, é “metarrepresentacional”, no sentido de que é sobre uma representação mental ou arquivo mental.Fil: Lo Guercio, Nicolás Francisco. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Filosofía y Letras. Instituto de Filosofía "Dr. Alejandro Korn"; Argentin

Logic is Metaphysics

Analyzing the position of two philosophers whose views are recognizably divergent, W. O. Quine and M. Dummett, we intend to support a striking point of agreement between them: the idea that our logical principles constitute our principles about what there is, and therefore, that logic is metaphysics

State Highlights 12/17/1952

This is the student newspaper from Western State High School, the high school that was on the campus of Western Michigan University, then called State Highlights, in 1952. This should be Volume 15

An EPTAS for Scheduling on Unrelated Machines of Few Different Types

In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the maximum machine load. It is well known that this problem is NP-hard and does not allow polynomial time approximation algorithms with approximation guarantees smaller than $1.5$ unless P$=$NP. We consider the case that there are only a constant number $K$ of machine types. Two machines have the same type if all jobs have the same processing time for them. This variant of the problem is strongly NP-hard already for $K=1$. We present an efficient polynomial time approximation scheme (EPTAS) for the problem, that is, for any $\varepsilon > 0$ an assignment with makespan of length at most $(1+\varepsilon)$ times the optimum can be found in polynomial time in the input length and the exponent is independent of $1/\varepsilon$. In particular we achieve a running time of $2^{\mathcal{O}(K\log(K) \frac{1}{\varepsilon}\log^4 \frac{1}{\varepsilon})}+\mathrm{poly}(|I|)$, where $|I|$ denotes the input length. Furthermore, we study three other problem variants and present an EPTAS for each of them: The Santa Claus problem, where the minimum machine load has to be maximized; the case of scheduling on unrelated parallel machines with a constant number of uniform types, where machines of the same type behave like uniformly related machines; and the multidimensional vector scheduling variant of the problem where both the dimension and the number of machine types are constant. For the Santa Claus problem we achieve the same running time. The results are achieved, using mixed integer linear programming and rounding techniques

An effective approach to routing problems

The Clarke-Wright method is one of the commonly applied heuristic methods used for finding solutions of the vehicle routing problems. This paper describes differential modification of the original Clarke-Wright method