Contents
68 found
Order:
1 — 50 / 68
  1. A partial model theory and some of its applications.Rodolfo Cunha Carnier - manuscript
    In this paper, we introduce the basics of what we shall call "partial model theory", which is an extension of traditional model theory to partial structures. These are a specific kind of structure developed within the partial structures approach, which is a view constituting the semantic approach of theories. And together with other related semantical concepts, like the concept of quasi-truth, partial structures have been used in contemporary philosophy of science for several purposes. Nonetheless, those uses presuppose certain technical results, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Algunos tópicos de Lógica matemática y los Fundamentos de la matemática.Franklin Galindo - manuscript
    En este trabajo matemático-filosófico se estudian cuatro tópicos de la Lógica matemática: El método de construcción de modelos llamado Ultraproductos, la Propiedad de Interpolación de Craig, las Álgebras booleanas y los Órdenes parciales separativos. El objetivo principal del mismo es analizar la importancia que tienen dichos tópicos para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático. Para cumplir con tal objetivo se trabajará en el ámbito de la Matemática, de la Metamatemática y (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Nota: ¿CUÁL ES EL CARDINAL DEL CONJUNTO DE LOS NÚMEROS REALES?Franklin Galindo - manuscript
    ¿Qué ha pasado con el problema del cardinal del continuo después de Gödel (1938) y Cohen (1964)? Intentos de responder esta pregunta pueden encontrarse en los artículos de José Alfredo Amor (1946-2011), "El Problema del continuo después de Cohen (1964-2004)", de Carlos Di Prisco , "Are we closer to a solution of the continuum problem", y de Joan Bagaria, "Natural axioms of set and the continuum problem" , que se pueden encontrar en la biblioteca digital de mi blog de Lógica (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. A statistical learning approach to a problem of induction.Kino Zhao - manuscript
    At its strongest, Hume's problem of induction denies the existence of any well justified assumptionless inductive inference rule. At the weakest, it challenges our ability to articulate and apply good inductive inference rules. This paper examines an analysis that is closer to the latter camp. It reviews one answer to this problem drawn from the VC theorem in statistical learning theory and argues for its inadequacy. In particular, I show that it cannot be computed, in general, whether we are in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Syntactic characterizations of first-order structures in mathematical fuzzy logic.Guillermo Badia, Pilar Dellunde, Vicent Costa & Carles Noguera - forthcoming - Soft Computing.
    This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. The Truth Table Formulation of Propositional Logic.Tristan Grøtvedt Haze - forthcoming - Teorema: International Journal of Philosophy.
    Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for groups of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Inferential Quantification and the ω-rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345--372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. (1 other version)Objects are (not) ...Friedrich Wilhelm Grafe - 2024 - Archive.Org.
    My goal in this paper is, to tentatively sketch and try defend some observations regarding the ontological dignity of object references, as they may be used from within in a formalized language. -/- Hence I try to explore, what properties objects are presupposed to have, in order to enter the universe of discourse of an interpreted formalized language. -/- First I review Frege′s analysis of the logical structure of truth value definite sentences of scientific colloquial language, to draw suggestions from (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. (1 other version)The Non-categoricity of Logic (I). The Problem of a Full Formalization (in Romanian).Constantin C. Brîncuș - 2022 - Probleme de Logică (Problems of Logic) (1):137-156.
    A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the standard (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Mathematical Internal Realism.Tim Button - 2022 - In Sanjit Chakraborty & James Ferguson Conant (eds.), Engaging Putnam. Berlin, Germany: De Gruyter. pp. 157-182.
    In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  12. El Axioma de elección en el quehacer matemático contemporáneo.Franklin Galindo & Randy Alzate - 2022 - Aitías 2 (3):49-126.
    Para matemáticos interesados en problemas de fundamentos, lógico-matemáticos y filósofos de la matemática, el axioma de elección es centro obligado de reflexión, pues ha sido considerado esencial en el debate dentro de las posiciones consideradas clásicas en filosofía de la matemática (intuicionismo, formalismo, logicismo, platonismo), pero también ha tenido una presencia fundamental para el desarrollo de la matemática y metamatemática contemporánea. Desde una posición que privilegia el quehacer matemático, nos proponemos mostrar los aportes que ha tenido el axioma en varias (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. Combing Graphs and Eulerian Diagrams in Eristic.Jens Lemanski & Reetu Bhattacharjee - 2022 - In Valeria Giardino, Sven Linker, Tony Burns, Francesco Bellucci, J. M. Boucheix & Diego Viana (eds.), Diagrammatic Representation and Inference. 13th International Conference, Diagrams 2022, Rome, Italy, September 14–16, 2022, Proceedings. Springer. pp. 97–113.
    In this paper, we analyze and discuss Schopenhauer’s n-term diagrams for eristic dialectics from a graph-theoretical perspective. Unlike logic, eristic dialectics does not examine the validity of an isolated argument, but the progression and persuasiveness of an argument in the context of a dialogue or even controversy. To represent these dialogue situations, Schopenhauer created large maps with concepts and Euler-type diagrams, which from today’s perspective are a specific form of graphs. We first present the original method with Euler-type diagrams, then (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  14. A methodological note on proving agreement between the Elementary Process Theory and modern interaction theories.Cabbolet Marcoen - 2022 - In Marcoen J. T. F. Cabbolet (ed.), And now for something completely different: the Elementary Process Theory. Revised, updated and extended 2nd edition of the dissertation with almost the same title. Utrecht: Eburon Academic Publishers. pp. 373-382.
    The Elementary Process Theory (EPT) is a collection of seven elementary process-physical principles that describe the individual processes by which interactions have to take place for repulsive gravity to exist. One of the two main problems of the EPT is that there is no proof that the four fundamental interactions (gravitational, electromagnetic, strong, and weak) as we know them can take place in the elementary processes described by the EPT. This paper sets forth the method by which it can be (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. Théorie des modèles, de la simulation et représentation scientifique chez Mario Bunge.Jean Robillard - 2022 - Mεtascience: Discours Général Scientifique 2:45-73.
    On entend généralement par « théorie des modèles » autant la métamathématique (ou sémantique formelle) que la sémantique des modèles des sciences non formelles. Cet article a pour objet la théorie des modèles scientifiques que Mario Bunge a développée dans Method, Models and Matter (1973). J’y analyse l’intégration théorique qu’opère Bunge des sciences formelles et des sciences expérimentales ou observationnelles, laquelle prend appui sur sa philosophie des sciences. Je la compare sommairement à la théorie des modèles de Gilles-Gaston Granger dans (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. True Pejorative Sentences Beyond the Existential Core: On Some Unwelcome Implications of Hom and May's Theory.Ludovic Soutif & André Pontes - 2022 - Kriterion: Journal of Philosophy 63 (153):757-780.
    This paper considers one of the most significant and controversial attempts to account for the meaning of pejoratives as lexical items, namely Hom and May’s. After outlining the theory, we pinpoint sets of pejorative sentences that come out true on their account and for which the question as to whether they are compatible with the view advocated by them (so-called Moral and Semantic Innocence) remains open. Helping ourselves to the standard model-theoretical framework Hom and May (presumably) work in, we prove (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. Extension and Self-Connection.Ben Blumson & Manikaran Singh - 2021 - Logic and Logical Philosophy 30 (3):435-59.
    If two self-connected individuals are connected, it follows in classical extensional mereotopology that the sum of those individuals is self-connected too. Since mainland Europe and mainland Asia, for example, are both self-connected and connected to each other, mainland Eurasia is also self-connected. In contrast, in non-extensional mereotopologies, two individuals may have more than one sum, in which case it does not follow from their being self-connected and connected that the sum of those individuals is self-connected too. Nevertheless, one would still (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. TRES TEOREMAS SOBRE CARDINALES MEDIBLES.Franklin Galindo - 2021 - Mixba'al. Revista Metropolitana de Matemáticas 12 (1):15-31.
    El estudio de los "cardinales grandes" es uno de los principales temas de investigación de la teoría de conjuntos y de la teoría de modelos que ha contribuido con el desarrollo de dichas disciplinas. Existe una gran variedad de tales cardinales, por ejemplo cardinales inaccesibles, débilmente compactos, Ramsey, medibles, supercompactos, etc. Tres valiosos teoremas clásicos sobre cardinales medibles son los siguientes: (i) compacidad débil, (ii) Si κ es un cardinal medible, entonces κ es un cardinal inaccesible y existen κ cardinales (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. On classical set-compatibility.Luis Felipe Bartolo Alegre - 2020 - El Jardín de Senderos Que Se Bifurcan y Confluyen: Filosofía, Lógica y Matemáticas.
    In this paper, I generalise the logical concept of compatibility into a broader set-theoretical one. The basic idea is that two sets are incompatible if they produce at least one pair of opposite objects under some operation. I formalise opposition as an operation ′ ∶ E → E, where E is the set of opposable elements of our universe U, and I propose some models. From this, I define a relation ℘U × ℘U × ℘U^℘U, which has (mutual) logical compatibility (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  20. Tópicos de Ultrafiltros.Franklin Galindo - 2020 - Divulgaciones Matematicas 21 (1-2):54-77.
    Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are a wide variety of classical theorems in various branches of mathematics where ultrafilters are applied in their proof, and other classical theorems that deal directly with ultrafilters. The objective of this article is to contribute (in a divulgative way) to ultrafilter research by describing the demonstrations of some such theorems related (uniquely or in combination) to topology, Measure Theory, algebra, combinatorial infinite, set theory and first-order logic, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  21. Un teorema sobre el Modelo de Solovay.Franklin Galindo - 2020 - Divulgaciones Matematicas 21 (1-2): 42–46.
    The objective of this article is to present an original proof of the following theorem: Thereis a generic extension of the Solovay’s model L(R) where there is a linear order of P(N)/fin that extends to the partial order (P(N)/f in), ≤*). Linear orders of P(N)/fin are important because, among other reasons, they allow constructing non-measurable sets, moreover they are applied in Ramsey's Theory .
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  22. Understanding What We Ought and Shall Do: A Hyperstate Semantics for Descriptive, Prescriptive, and Intentional Sentences.Preston Stovall - 2020 - In Ladislav Koreň, Hans Bernhard Schmid, Preston Stovall & Leo Townsend (eds.), Groups, Norms and Practices: Essays on Inferentialism and Collective Intentionality. Cham: Springer. pp. 215-238.
    This essay is part of a larger project aimed at making sense of rational thought and agency as part of the natural world. It provides a semantic framework for thinking about the contents of: 1) descriptive thoughts and sentences having a representational or mind-to-world direction of fit, and which manifest our capacity for theoretical rationality; and 2) prescriptive and intentional sentences having an expressive or world-to-mind direction of fit, and which manifest our capacity for practical rationality. I use a modified (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  23. Substitution Structures.Andrew Bacon - 2019 - Journal of Philosophical Logic 48 (6):1017-1075.
    An increasing amount of twenty-first century metaphysics is couched in explicitly hyperintensional terms. A prerequisite of hyperintensional metaphysics is that reality itself be hyperintensional: at the metaphysical level, propositions, properties, operators, and other elements of the type hierarchy, must be more fine-grained than functions from possible worlds to extensions. In this paper I develop, in the setting of type theory, a general framework for reasoning about the granularity of propositions and properties. The theory takes as primitive the notion of a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   17 citations  
  24. Are the open-ended rules for negation categorical?Constantin C. Brîncuș - 2019 - Synthese 198 (8):7249-7256.
    Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  25. A model-theoretic analysis of Fidel-structures for mbC.Marcelo E. Coniglio - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 189-216.
    In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  26. Algunas notas introductorias sobre la Teoría de Conjuntos.Franklin Galindo - 2019 - Apuntes Filosóficos: Revista Semestral de la Escuela de Filosofía 18 (55):201-232.
    The objective of this document is to present three introductory notes on set theory: The first note presents an overview of this discipline from its origins to the present, in the second note some considerations are made about the evaluation of reasoning applying the first-order Logic and Löwenheim's theorems, Church Indecidibility, Completeness and Incompleteness of Gödel, it is known that the axiomatic theories of most commonly used sets are written in a specific first-order language, that is, they are developed within (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. A Note on Carnap’s Result and the Connectives.Tristan Haze - 2019 - Axiomathes 29 (3):285-288.
    Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and I demonstrate (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Laws of Thought and Laws of Logic after Kant.Lydia Patton - 2018 - In Sandra Lapointe (ed.), Logic from Kant to Russell. New York: Routledge. pp. 123-137.
    George Boole emerged from the British tradition of the “New Analytic”, known for the view that the laws of logic are laws of thought. Logicians in the New Analytic tradition were influenced by the work of Immanuel Kant, and by the German logicians Wilhelm Traugott Krug and Wilhelm Esser, among others. In his 1854 work An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities, Boole argues that the laws of thought acquire (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  29. Paraconsistent Logic as Model Building.Ricardo Sousa Silvestre - 2018 - South American Journal of Logic 1 (4):195-217.
    The terms “model” and “model-building” have been used to characterize the field of formal philosophy, to evaluate philosophy’s and philosophical logic’s progress and to define philosophical logic itself. A model is an idealization, in the sense of being a deliberate simplification of something relatively complex in which several important aspects are left aside, but also in the sense of being a view too perfect or excellent, not found in reality, of this thing. Paraconsistent logic is a branch of philosophical logic. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. The Lvov-Warsaw School. Past and Present.Urszula Wybraniec-Skardowska & Ángel Garrido (eds.) - 2018 - Cham, Switzerland: Springer- Birkhauser,.
    This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  31. Model Theory, Hume's Dictum, and the Priority of Ethical Theory.Jack Woods & Barry Maguire - 2017 - Ergo: An Open Access Journal of Philosophy 4:419-440.
    It is regrettably common for theorists to attempt to characterize the Humean dictum that one can’t get an ‘ought’ from an ‘is’ just in broadly logical terms. We here address an important new class of such approaches which appeal to model-theoretic machinery. Our complaint about these recent attempts is that they interfere with substantive debates about the nature of the ethical. This problem, developed in detail for Daniel Singer’s and Gillian Russell and Greg Restall’s accounts of Hume’s dictum, is of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  32. Structure and Categoricity: Determinacy of Reference and Truth Value in the Philosophy of Mathematics.Tim Button & Sean Walsh - 2016 - Philosophia Mathematica 24 (3):283-307.
    This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   12 citations  
  33. Una presentación de la demostración directa del teorema de compacidad de la lógica de primer orden que usa el método de ultraproductos.Franklin Galindo - 2016 - UnaInvestigación 1 (1):1-25.
    El objetivo principal de este artículo es presentar la demostración directa del Teorema de compacidad de la Lógica de primer orden (Gama tiene un modelo si y sólo si cada subconjunto finito de Gama tiene un modelo) que se realiza utilizando el Método de construcción de modelos llamado "Ultraproductos" que, a su vez, usa "Ultrafiltros". Actualmente es más común demostrar el Teorema de compacidad como un corolario del Teorema de completitud de Gödel y usar el método de reducción al absurdo (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Dos Teoremas de interpolación.Franklin Galindo - 2016 - Divulgaciones Matematicas 17 ( 2):15-42.
    En este artículo se presentan dos demostraciones del teorema de interpolación: Una para la lógica proposicional y otra para la lógica de primer orden. Ambas se realizan en el contexto de la teoría de modelos. El teorema de interpolación afirma que si A y B son fórmulas, donde A no es una contradicción, B no es válida, y B es una consecuencia lógica de A, entonces existe una fórmula C que esta escrita en el lenguaje común al de A y (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  35. The Model-Theoretic Argument: From Skepticism to a New Understanding.Gila Sher - 2015 - In Sanford Goldberg (ed.), The Brain in a Vat. United Kingdom: Cambridge University Press. pp. 208-225.
    In this paper I investigate Putnam’s model-theoretic argument from a transcendent standpoint, in spite of Putnam’s well-known objections to such a standpoint. This transcendence, however, requires ascent to something more like a Tarskian meta-level than what Putnam regards as a “God’s eye view”. Still, it is methodologically quite powerful, leading to a significant increase in our investigative tools. The result is a shift from Putnam’s skeptical conclusion to a new understanding of realism, truth, correspondence, knowledge, and theories, or certain aspects (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Dos Tópicos de Lógica Matemática y sus Fundamentos.Franklin Galindo - 2014 - Episteme NS: Revista Del Instituto de Filosofía de la Universidad Central de Venezuela 34 (1):41-66..
    El objetivo de este artículo es presentar dos tópicos de Lógica matemática y sus fundamentos: El primer tópico es una actualización de la demostración de Alonzo Church del Teorema de completitud de Gödel para la Lógica de primer orden, la cual aparece en su texto "Introduction to Mathematical Logic" (1956) y usa el procedimientos efectivos de Forma normal prenexa y Forma normal de Skolem; y el segundo tópico es una demostración de que la propiedad de partición (tipo Ramsey) del espacio (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  37. Constructing formal semantics from an ontological perspective. The case of second-order logics.Thibaut Giraud - 2014 - Synthese 191 (10):2115-2145.
    In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics from an (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  38. On Pathological Truths.Damian Szmuc & Lucas Rosenblatt - 2014 - Review of Symbolic Logic 7 (4):601-617.
    In Kripke’s classic paper on truth it is argued that by adding a new semantic category different from truth and falsity it is possible to have a language with its own truth predicate. A substantial problem with this approach is that it lacks the expressive resources to characterize those sentences which fall under the new category. The main goal of this paper is to offer a refinement of Kripke’s approach in which this difficulty does not arise. We tackle this characterization (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   8 citations  
  39. The Metaphysical Interpretation of Logical Truth.Tuomas Tahko - 2014 - In Penelope Rush (ed.), The Metaphysics of Logic. New York: Cambridge University Press. pp. 233-248.
    The starting point of this paper concerns the apparent difference between what we might call absolute truth and truth in a model, following Donald Davidson. The notion of absolute truth is the one familiar from Tarski’s T-schema: ‘Snow is white’ is true if and only if snow is white. Instead of being a property of sentences as absolute truth appears to be, truth in a model, that is relative truth, is evaluated in terms of the relation between sentences and models. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  40. Non-classical Metatheory for Non-classical Logics.Andrew Bacon - 2013 - Journal of Philosophical Logic 42 (2):335-355.
    A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   22 citations  
  41. All Things Must Pass Away.Joshua Spencer - 2012 - Oxford Studies in Metaphysics 7:67.
    Are there any things that are such that any things whatsoever are among them. I argue that there are not. My thesis follows from these three premises: (1) There are two or more things; (2) for any things, there is a unique thing that corresponds to those things; (3) for any two or more things, there are fewer of them than there are pluralities of them.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   16 citations  
  42. Non-Normal Worlds and Representation.Francesco Berto - 2011 - In Michal Peliš & Vít Punčochář (eds.), The Logica Yearbook. College Publications.
    World semantics for relevant logics include so-called non-normal or impossible worlds providing model-theoretic counterexamples to such irrelevant entailments as (A ∧ ¬A) → B, A → (B∨¬B), or A → (B → B). Some well-known views interpret non-normal worlds as information states. If so, they can plausibly model our ability of conceiving or representing logical impossibilities. The phenomenon is explored by combining a formal setting with philosophical discussion. I take Priest’s basic relevant logic N4 and extend it, on the syntactic (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  43. Model-checking CTL* over flat Presburger counter systems.Stéphane Demri, Alain Finkel, Valentin Goranko & Govert van Drimmelen - 2010 - Journal of Applied Non-Classical Logics 20 (4):313-344.
    This paper concerns model-checking of fragments and extensions of CTL* on infinite-state Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. In general, reachability properties of counter systems are undecidable, but we have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated by quantification over tuples of natural numbers, eventually allowing translation of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Perfect set properties in models of ZF.Franklin Galindo & Carlos Di Prisco - 2010 - Fundamenta Mathematicae 208 (208):249-262.
    We study several perfect set properties of the Baire space which follow from the Ramsey property ω→(ω) ω . In particular we present some independence results which complete the picture of how these perfect set properties relate to each other.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  45. Constructibilidad relativizada y el Axioma de elección.Franklin Galindo & Carlos Di Prisco - 2010 - Mixba'al. Revista Metropolitana de Matemáticas 1 (1):23-40.
    El objetivo de este trabajo es presentar en un solo cuerpo tres maneras de relativizar (o generalizar) el concepto de conjunto constructible de Gödel que no suelen aparecer juntas en la literatura especializada y que son importantes en la Teoría de Conjuntos, por ejemplo para resolver problemas de consistencia o independencia. Presentamos algunos modelos resultantes de las diferentes formas de relativizar el concepto de constructibilidad, sus propiedades básicas y algunas formas débiles del Axioma de Elección válidas o no válidas en (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  46. Theories with the Independence Property, Studia Logica 2010 95:379-405.Mlj van de Vel - 2010 - Studia Logica 95 (3):379-405.
    A first-order theory T has the Independence Property provided deduction of a statement of type (quantifiers) (P -> (P1 or P2 or .. or Pn)) in T implies that (quantifiers) (P -> Pi) can be deduced in T for some i, 1 <= i <= n). Variants of this property have been noticed for some time in logic programming and in linear programming. We show that a first-order theory has the Independence Property for the class of basic formulas provided it (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  47. (1 other version)Algorithmic correspondence and completeness in modal logic. IV. Semantic extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Learning to apply theory of mind.Rineke Verbrugge & Lisette Mol - 2008 - Journal of Logic, Language and Information 17 (4):489-511.
    In everyday life it is often important to have a mental model of the knowledge, beliefs, desires, and intentions of other people. Sometimes it is even useful to to have a correct model of their model of our own mental states: a second-order Theory of Mind. In order to investigate to what extent adults use and acquire complex skills and strategies in the domains of Theory of Mind and the related skill of natural language use, we conducted an experiment. It (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  49. GENERAL SYSTEM THEORY, LIKEQUANTUM SEMANTICS AND FUZZY SETS.Ignazio Licata - 2006 - In G. Minati (ed.), Systemics of Emergence. Research and Developement. Springer.
    It is outlined the possibility to extend the quantum formalism in relation to the requirements of the general systems theory. It can be done by using a quantum semantics arising from the deep logical structure of quantum theory. It is so possible taking into account the logical openness relationship between observer and system. We are going to show how considering the truth-values of quantum propositions within the context of the fuzzy sets is here more useful for systemics. In conclusion we (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  50. Possible m-diagrams of models of arithmetic.Andrew Arana - 2005 - In Stephen Simpson (ed.), Reverse Mathematics 2001. Association for Symbolic Logic.
    In this paper I begin by extending two results of Solovay; the first characterizes the possible Turing degrees of models of True Arithmetic (TA), the complete first-order theory of the standard model of PA, while the second characterizes the possible Turing degrees of arbitrary completions of P. I extend these two results to characterize the possible Turing degrees of m-diagrams of models of TA and of arbitrary complete extensions of PA. I next give a construction showing that the conditions Solovay (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 68