This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related

Contents
6368 found
Order:
1 — 50 / 6368
  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   Direct 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   Direct 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   Direct 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   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  5. Two notes on abstract model theory. I. properties invariant on the range of definable relations between structures.Solomon Feferman with with R. L. Vaught - manuscript
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  6. Two notes on abstract model theory. II. languages for which the set of valid sentences is semi-invariantly implicitly definable.Solomon Feferman with with R. L. Vaught - manuscript
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  7. Partiality and Adjointness in Modal Logic.Wesley H. Holliday - unknown - In Rajeev Gore (ed.), Advances in modal logic, volume. pp. 313-332.
    Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  8. Rijke. PDL for ordered trees.Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Gaiffe Evan, Goris Maarten & Marx Maarten - forthcoming - Journal of Applied Non-Classical Logics.
  9. Dependent choice, properness, and generic absoluteness.David Asperó & Asaf Karagila - forthcoming - Review of Symbolic Logic:1-25.
    We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. 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   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Local Applications of Logics via Model-Theoretic Interpretations.Carlos Benito-Monsalvo - forthcoming - Logic and Logical Philosophy:1-22.
    This paper analyses the notion of ‘interpretation’, which is often tied to the semantic approach to logic, where it is used when referring to truth-value assignments, for instance. There are, however, other uses of the notion that raise interesting problems. These are the cases in which interpreting a logic is closely related to its justification for a given application. The paper aims to present an understanding of interpretations that supports the model-theoretic characterization of validity to the detriment of the proof-theoretic (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. The additive groups of ℤ and ℚ with predicates for being square‐free.Neer Bhardwaj & Minh Chieu Tran - forthcoming - Journal of Symbolic Logic:1-26.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Transmission of Verification.Ethan Brauer & Neil Tennant - forthcoming - Review of Symbolic Logic:1-16.
    This paper clarifies, revises, and extends the account of the transmission of truthmakers by core proofs that was set out in chap. 9 of Tennant. Brauer provided two kinds of example making clear the need for this. Unlike Brouwer’s counterexamples to excluded middle, the examples of Brauer that we are dealing with here establish the need for appeals to excluded middle when applying, to the problem of truthmaker-transmission, the already classical metalinguistic theory of model-relative evaluations.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14. Twist-Valued Models for Three-Valued Paraconsistent Set Theory.Walter A. Carnielli & Marcelo E. Coniglio - forthcoming - Logic and Logical Philosophy:1.
    We propose in this paper a family of algebraic models of ZFC based on the three-valued paraconsistent logic LPT0, a linguistic variant of da Costa and D’Ottaviano’s logic J3. The semantics is given by twist structures defined over complete Boolean agebras. The Boolean-valued models of ZFC are adapted to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. This allows for inconsistent sets w satisfying ‘not (w = w)’, where ‘not’ stands for the paraconsistent negation. Finally, our (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15. Domain Formula Circumscription.Tom Costello - forthcoming - Journal of Logic Language and Information.
  16. Sur quelques relations entre Les zéros et Les poLes Des fonctions méromorphes. Applications au developpement de Mittag-Leffler.Jeanne Férentinou-Nicolacopoulou - forthcoming - Eleutheria.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  17. Bisimulations for Knowing How Logics.Raul Fervari, Fernando R. Velázquez-Quesada & Yanjing Wang - forthcoming - Review of Symbolic Logic:1-37.
    As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of these (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18. Absoluteness and the Skolem Paradox.Michael Hallett - forthcoming - Unpublished.
    Remove from this list  
     
    Export citation  
     
    Bookmark   1 citation  
  19. 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   Direct download  
     
    Export citation  
     
    Bookmark  
  20. The Taming of Content: Some Thoughts About Domains and Modules.Keith J. Holyoak & Patricia W. Cheng - forthcoming - Thinking and Reasoning.
  21. A bounded arithmetictheory for LOGCFL.S. Kuroda - forthcoming - Archive for Mathematical Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  22. A Model Theory of Topology.Paolo Lipparini - forthcoming - Studia Logica:1-35.
    An algebraization of the notion of topology has been proposed more than 70 years ago in a classical paper by McKinsey and Tarski, leading to an area of research still active today, with connections to algebra, geometry, logic and many applications, in particular, to modal logics. In McKinsey and Tarski’s setting the model theoretical notion of homomorphism does not correspond to the notion of continuity. We notice that the two notions correspond if instead we consider a preorder relation \( \sqsubseteq (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23. Badiou, Mathematics, and Model Theory.Paul Livingston - forthcoming - MonoKL.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Hyperbolic towers and independent generic sets in the theory of free groups, to appear in the Proceedings of the conference" Recent developments in Model Theory.Lars Louder, Chloé Perin & Rizos Sklinos - forthcoming - Notre Dame Journal of Formal Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  25. Groups of Worldview Transformations Implied by Einstein’s Special Principle of Relativity over Arbitrary Ordered Fields.Judit X. Madarász, Mike Stannett & Gergely Székely - forthcoming - Review of Symbolic Logic:1-28.
    In 1978, Yu. F. Borisov presented an axiom system using a few basic assumptions and four explicit axioms, the fourth being a formulation of the relativity principle; and he demonstrated that this axiom system had (up to choice of units) only two models: a relativistic one in which worldview transformations are Poincaré transformations and a classical one in which they are Galilean. In this paper, we reformulate Borisov’s original four axioms within an intuitively simple, but strictly formal, first-order logic framework, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. Definability in valued Ore modules.Françoise Point - forthcoming - Bulletin of Symbolic Logic.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  27. Quine’s fluted fragment revisited.Ian Pratt-Hartmann, Wiesław Szwast & Lidia Tendera - forthcoming - Journal of Symbolic Logic:1-30.
  28. A Short Note on the Early History of the Spectrum Problem and Finite Model Theory.Andrea Reichenberger - forthcoming - History and Philosophy of Logic:1-10.
    Finite model theory is currently not one of the hot topics in the philosophy and history of mathematics, not even in the philosophy and history of mathematical logic. The philosophy of mathematics and mathematical logic has concentrated on infinite structures, closely related to foundational issues. In that context, finite models deserved only marginal attention because it was taken for granted that the study of finite structures is trivial compared to the study of infinite structures. In retrospect, research on finite structures (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. Special Issue on Recent Advances in Logical and Algebraic Approaches to Grammar, volume 7 (4) of.C. Retoré - forthcoming - Journal of Logic Language and Information.
    This a special issue of the Journal of Logic Language and Information that I edited.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  30. From Anti-exceptionalism to Feminist Logic.Gillian Russell - forthcoming - Hypatia (Online first):1-19.
    Anti-exceptionalists about formal logic think that logic is continuous with the sciences. Many philosophers of science think that there is feminist science. Putting these together: can anti-exceptionalism make space for feminist logic? The answer depends on the details of the ways logic is like science and the ways science can be feminist. This paper wades into these details, examines five different approaches, and ultimately argues that anti-exceptionalism makes space for feminist logic in several different ways.
    Remove from this list  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Variations on determinacy and.Ramez L. Sami - forthcoming - Journal of Symbolic Logic:1-10.
  32. A Fully Model-Theoretic Semantics for Model-Preference Default Systems', Istituto di Elaborazione dell'Informazione, Pisa.F. Sebastiani - forthcoming - Studia Logica.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  33. On the notion of Guessing model.Matteo Viale - forthcoming - Annals of Pure and Applied Logic.
  34. 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   Direct download  
     
    Export citation  
     
    Bookmark  
  35. 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   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36. 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   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37. Modal Model Theory.Joel David Hamkins & Wojciech Aleksander Wołoszyn - 2024 - Notre Dame Journal of Formal Logic 65 (1):1-37.
    We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A statement φ is possible in a structure (written φ) if φ is true in some extension of that structure, and φ is necessary (written φ) if it is true in all extensions of the structure. A principal case for us will be the class Mod(T) (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38. Model Theory of Nonstandard Structures with Applications.Roman Kossak - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 1921-1931.
    Every infinite mathematical structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal{M} $$\end{document} has an extension M∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ {\mathcal{M}}^{\ast } $$\end{document} that has the same first-order properties as M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal{M} $$\end{document}, but is not isomorphic to M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal{M} $$\end{document}. In this sense, M∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  39. On duality and model theory for polyadic spaces.Sam van Gool & Jérémie Marquès - 2024 - Annals of Pure and Applied Logic 175 (2):103388.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Admissibility of Π2-Inference Rules: interpolation, model completion, and contact algebras.Nick Bezhanishvili, Luca Carai, Silvio Ghilardi & Lucia Landi - 2023 - Annals of Pure and Applied Logic 174 (1):103169.
  41. A Unified Interpretation of the Semantics of Relevance Logic.Rea Golan - 2023 - Mind 132 (528).
    I introduce a novel and quite intuitive interpretation of the ternary relation that figures in the relational semantics of many relevance logics. Conceptually, my interpretation makes use only of incompatibility and parthood relations, defined over a set of states. In this way, the proposed interpretation—of the ternary relation and the conditional—extends Dunn’s and Restall’s works on negation and the Routley star operator. Therefore, the interpretation is unified, and hence not only intuitive but also parsimonious. Additionally, the interpretation provides us with (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Games and Cardinalities in Inquisitive First-Order Logic.Gianluca Grilletti & Ivano Ciardelli - 2023 - Review of Symbolic Logic 16 (1):241-267.
    Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. This paper makes two contributions to the study of this logic. First, we describe an Ehrenfeucht–Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. Second, we use the game to study cardinality quantifiers in the inquisitive setting. That is, we study what (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Model Theory of Fields with Finite Group Scheme Actions.Daniel Max Hoffmann & Piotr Kowalski - 2023 - Journal of Symbolic Logic 88 (4):1443-1468.
    We study model theory of fields with actions of a fixed finite group scheme. We prove the existence and simplicity of a model companion of the theory of such actions, which generalizes our previous results about truncated iterative Hasse–Schmidt derivations [13] and about Galois actions [14]. As an application of our methods, we obtain a new model complete theory of actions of a finite group on fields of finite imperfection degree.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44. On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.
  45. Maximal Towers and Ultrafilter Bases in Computability Theory.Steffen Lempp, Joseph S. Miller, André Nies & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (3):1170-1190.
    The tower number ${\mathfrak t}$ and the ultrafilter number $\mathfrak {u}$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $\omega $ and the almost inclusion relation $\subseteq ^*$ between such subsets. We consider analogs of these cardinal characteristics in computability theory.We say that a sequence $(G_n)_{n \in {\mathbb N}}$ of computable sets is a tower if $G_0 = {\mathbb N}$, $G_{n+1} \subseteq ^* G_n$, and $G_n\smallsetminus G_{n+1}$ is infinite for each n. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. Internalism and the Determinacy of Mathematics.Lavinia Picollo & Daniel Waxman - 2023 - Mind 132 (528):1028-1052.
    A major challenge in the philosophy of mathematics is to explain how mathematical language can pick out unique structures and acquire determinate content. In recent work, Button and Walsh have introduced a view they call ‘internalism’, according to which mathematical content is explained by internal categoricity results formulated and proven in second-order logic. In this paper, we critically examine the internalist response to the challenge and discuss the philosophical significance of internal categoricity results. Surprisingly, as we argue, while internalism arguably (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  47. Model Theory and Proof Theory of the Global Reflection Principle.Mateusz Zbigniew Łełyk - 2023 - Journal of Symbolic Logic 88 (2):738-779.
    The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of$\mathrm {Th}$are true,” where$\mathrm {Th}$is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski’s proof from [15], showing that the Global Reflection Principle for Peano Arithmetic is provable in the theory of compositional truth with bounded induction only ($\mathrm {CT}_0$). Furthermore, we (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48. A Modern Rigorous Approach to Stratification in NF/NFU.Tin Adlešić & Vedran Čačić - 2022 - Logica Universalis 16 (3):451-468.
    The main feature of NF/NFU is the notion of stratification, which sets it apart from other set theories. We define stratification and prove constructively that every stratified formula has the (unique) least assignment of types. The basic notion of stratification is concerned only with variables, but we extend it to abstraction terms in order to simplify further development. We reflect on nested abstraction terms, proving that they get the expected types. These extensions enable us to check whether some complex formula (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. Copying One of a Pair of Structures.Rachael Alvir, Hannah Burchfield & Julia F. Knight - 2022 - Journal of Symbolic Logic 87 (3):1201-1214.
    We ask when, for a pair of structures $\mathcal {A}_1,\mathcal {A}_2$, there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of $\mathcal {A}_1$. We give some conditions guaranteeing that there is such a procedure. The conditions might suggest that for the pair of orderings $\mathcal {A}_1$ of type $\omega _1^{CK}$ and $\mathcal {A}_2$ of Harrison type, there should not be any such procedure, but, in fact, there is one. We construct an (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. 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   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 6368