Results 71 to 80 of about 24,422 (242)
Abstract Contemporary ontologists, almost unanimously, dismiss the idea that sakes (as in ‘I did it for her sake’) exist. Likewise with the kibosh, snooks, behalves, dints, and so on. In this essay, I argue that there is no good reason for this near consensus, I begin to make a case that sakes and the like do exist, and I consider what this means more ...
Tristan Grøtvedt Haze
wiley +1 more source
Legal Systems and Complexity: A Comment on Allen
Abstract This work addresses Ronald J. Allen's views on complexity, evidence, and law. After some remarks on normative systems and the metaphors used to characterize them, the work addresses the issue of complexity by asking how a system characterized by complexity can tame the world's complexity; the focus then shifts to some aspects of evidence and ...
Giovanni Tuzet
wiley +1 more source
Common Fixed-Point Theorems in Modular Function Spaces Endowed with Reflexive Digraph
The purpose of this work is to extend the Knaster–Tarski fixed-point theorem to the wider field of reflexive digraph. We give also a DeMarr-type common fixed-point theorem in this context.
Jaauad Jeddi +2 more
doaj +1 more source
The Prolog Inference Model refutes Tarski Undefinability [PDF]
The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences.
Olcott, Pete
core
Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals
Abstract Motivated by recent work of Boney, Dimopoulos, Gitman, and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to show that, in contrast to the existence of strong compactness cardinals, the existence of weak ...
Philipp Lücke
wiley +1 more source
On the one‐dimensional polynomial, regular, and regulous images of closed balls and spheres
Abstract We present a full geometric characterization of the one‐dimensional (semialgebraic) images S$S$ of either n$n$‐dimensional closed balls B¯n⊂Rn$\overline{{\mathcal {B}}}_n\subset {\mathbb {R}}^n$ or n$n$‐dimensional spheres Sn⊂Rn+1${\mathbb {S}}^n\subset {\mathbb {R}}^{n+1}$ under polynomial, regular, and regulous maps for some n⩾1$n\geqslant 1$
José F. Fernando
wiley +1 more source
Algebraization of Jaśkowski’s Paraconsistent Logic D2
The aim of this paper is to present an algebraic approach to Jaśkowski’s paraconsistent logic D2. We present: a D2-discursive algebra, Lindenbaum- Tarski algebra for D2 and D2-matrices.
Ciuciura Janusz
doaj +1 more source
Gödel, Tarski, Church, and The Liar [PDF]
The fact that Gödel's famous incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of the community of logicians. Indeed, almost every more or less formal treatment of the theorem makes a reference to this connection.
openaire +3 more sources
On generic structures preserving elementary equivalence and elementary embeddability
We consider criteria for elementary equivalence and elementary embeddability for generic structures. They use classical characterizations for the general case.
S.V. Sudoplatov
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

