Solving the Caesar problem without categorical sortals

DOI10.1007/S10670-009-9159-9MaRDI QIDQ735346zbMATHOpenAlexFDO

Authors Nikolaj Jang Lee Linding Pedersen

Publication date 21 October 2009

Published in Erkenntnis (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10670-009-9159-9

zbMATH Keywords

Leibniz's lawCaesar problemconcept of Numberneo-Fregeanuniversal criterion of identity

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05)

Recommendations

• A strengthening of the Caesar problem
• scientific article; zbMATH DE number 1949644
• scientific article; zbMATH DE number 749938
• Counting the solutions of Presburger equations without enumerating them.
• Non-cyclic sorts for first-order satisfiability
• Solutions to Cintula's open problems
• A decidable word problem without equivalent canonical term rewriting system
• An unsolved problem in the theory of constructive order types
• Publication:4492883
• The complexity of computable categoricity

Cited in

(3)

• Identity and sortals (and Caesar)
• A strengthening of the Caesar problem
• Hume's principle: a plea for austerity

This page was built for publication: Solving the Caesar problem without categorical sortals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735346)