Some remarks on one-basedness
Logic
2019-04-15 v1
Authors:
Frank Olaf Wagner
Abstract
A type analysable in one-based types in a simple theory is itself one-based.
Keywords
Cite
@article{arxiv.1904.06054,
title = {Some remarks on one-basedness},
author = {Frank Olaf Wagner},
journal= {arXiv preprint arXiv:1904.06054},
year = {2019}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Simple Type Theory as Framework for Combining Logics
Christoph Benzmueller
2015-03-17
Logic · Mathematics
Type theoretical databases
Henrik Forssell, Håkon Robbestad Gylterud, David I. Spivak
2020-07-08
Logic in Computer Science · Computer Science
A Formulation of the Simple Theory of Types (for Isabelle)
Lawrence C. Paulson
2008-02-03
Logic · Mathematics
Algebraic Presentations of Dependent Type Theories
Valery Isaev
2017-03-28
Artificial Intelligence · Computer Science
A Note on Ontology and Ordinary Language
Walid S. Saba
2007-05-23
Logic · Mathematics
Un Crit{\`E}Re Simple
Thomas Blossier, Amador Martin-Pizarro
2019-12-19
Group Theory · Mathematics
Groups in simple theories
Frank Wagner
2008-02-03
Logic · Mathematics
A dichotomy for $D$-rank 1 types in simple theories
Ziv Shami
2019-09-20
Rings and Algebras · Mathematics
A note on Lascar strong types in simple theories
Byunghan Kim
2008-02-03
Logic in Computer Science · Computer Science
Logic-based similarity
Christian Antić
2023-05-02
Logic in Computer Science · Computer Science
Simple Type Theory as a Clausal Theory
Gilles Dowek
2023-04-27
Logic · Mathematics
On uncountable hypersimple unidimensional theories
Ziv Shami
2013-11-12
Logic in Computer Science · Computer Science
Type Theory based on Dependent Inductive and Coinductive Types
Henning Basold, Herman Geuvers
2016-05-10
Logic in Computer Science · Computer Science
Algebraic models of simple type theories: a polynomial approach
Nathanael Arkor, Marcelo Fiore
2020-07-01
Logic in Computer Science · Computer Science
Cubical Type Theory: a constructive interpretation of the univalence axiom
Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg
2016-11-14
Logic · Mathematics
Dependent Types Simplified
Tristan Bice
2025-08-07
Logic · Mathematics
A general definition of dependent type theories
Andrej Bauer, Philipp G. Haselwarter, Peter LeFanu Lumsdaine
2020-09-14
Logic in Computer Science · Computer Science
Isomorphism within Naive Type Theory
David McAllester
2018-01-23
Formal Languages and Automata Theory · Computer Science
Congruence based proofs of the recognizability theorems for free many-sorted algebras
Juan Climent Vidal, Enric Cosme Llópez
2024-01-18
Logic in Computer Science · Computer Science
Simple Types for Polymorphic Functions
Barry Jay, Johannes Bader
2026-04-15
Logic in Computer Science · Computer Science
Type Theory and its Meaning Explanations
Jonathan Sterling
2016-07-18
Dynamical Systems · Mathematics
A note on one-sided recognizable morphisms
Marie-Pierre Béal, Valérie Berthé, Dominique Perrin, Antonio Restivo
2022-04-13
Classical Analysis and ODEs · Mathematics
On a Unified Analysis in the language of preordered sets
Matthias Mossburger
2015-07-07
Logic · Mathematics
A Fitting Theorem for Simple Theories
Daniel Palacin, Frank Olaf Wagner
2017-05-04
Logic in Computer Science · Computer Science
Syntax and Semantics of Linear Dependent Types
Matthijs Vákár
2026-05-07