Results 51 to 60 of about 5,613 (178)

Identifiability of points and rigidity of hypergraphs under algebraic constraints

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank   +3 more
wiley   +1 more source

Fuzzy Results for Finitely Supported Structures

open access: yesMathematics, 2021
We present a survey of some results published recently by the authors regarding the fuzzy aspects of finitely supported structures. Considering the notion of finite support, we introduce a new degree of membership association between a crisp set and a ...
Andrei Alexandru, Gabriel Ciobanu
doaj   +1 more source

The common invariant subspace problem and Tarski’s theorem

open access: yes, 2017
This article presents a computable criterion for the existence of a common invariant subspace of n×n complex matrices A1, . . . , As of a fixed dimension 1 ≤ d ≤ n. The approach taken in the paper is model-theoretic.
G. Pastuszak
semanticscholar   +1 more source

(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English

open access: yesTheoria, Volume 92, Issue 3, June 2026.
ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley   +1 more source

Verdad y significado

open access: yesIdeas y Valores, 2004
El ensayo ofrece un esbozo del lugar del trabajo de Donald Davidson en elestudio de las semánticas formales para los lenguajes naturales. Se discu-ten algunas relaciones importantes entre el trabajo de Davidson y las ideasde Frege, Tarski, Quine y ...
Gabriel Segal
doaj  

HNN extensions and embedding theorems for groups

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract The Higman–Neumann–Neumann (HNN) paper of 1949 is a landmark of group theory in the 20th century. The proof of its main theorem covers less than a page and uses only pre‐existing technology, but the construction that it introduced, the HNN extension, quickly became one of the principal tools of combinatorial group theory, widely used to build ...
Martin R. Bridson   +1 more
wiley   +1 more source

Tarski's geometry modelled in Mizar computerized proof assistant

open access: yesConference on Computer Science and Information Systems, 2016
In the paper, we discuss the formal approach to Tarski geometry axioms modelled with the help of the Mizar computerized proof assistant system. Although our basic development was inspired by Julien Narboux's Coq pseudo-code and is dated back to 2014 ...
Adam Grabowski
semanticscholar   +1 more source

Model pluralism for logic

open access: yesNoûs, Volume 60, Issue 1, Page 136-160, March 2026.
Abstract It is well‐recognized in the sciences that a multitude of nonequivalent models are used by researchers to fulfill a range of goals, even for the same target system, a result known broadly as model pluralism. The possibility of the same form of pluralism occurring in logic, however, has not been adequately considered.
Ben Martin
wiley   +1 more source

ACERCA DA CONCEPÇÃO SEMÂNTICA DE VERDADE:

open access: yesPolymatheia, 2021
O presente artigo tem como objetivo inicial apresentar e discutir os pontos centrais da concepção semântica de verdade apresentada pelo lógico-matemático polonês Alfred Tarski.
Ícaro Coelho Martins
doaj  

Truths ancient and modern

open access: yesManuscrito, 2011
The paper presents a comparison of the theories of truth, and the solutions of the liar paradox, proposed by Thomas Bradwardine (c. 1290-1349), Jean Buridan (c. 1295-1358), and Alfred Tarski (1901-1983).
David Miller
doaj   +1 more source

Home - About - Disclaimer - Privacy