Solving the Caesar problem without categorical sortals

DOI10.1007/S10670-009-9159-9zbMATH Open1182.03022OpenAlexW2142262419MaRDI QIDQ735346FDOQ735346

Authors: Nikolaj Jang Lee Linding Pedersen 

Publication date: 21 October 2009

Published in: Erkenntnis (Search for Journal in Brave)

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• 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)