The infinite sequences of objects posited by Tarski's recursive satisfaction clauses are no less ontologically costly than the structured propositions or intensions they are meant to replace.

?Rate how convincing each reason is below to see the overall strength.

No one has weighed in yet. Be the first to share reasons for or against this statement.

Ontologically costly(The more stuff you have to say exists, the higher the 'cost' of your position): Requiring you to believe in more things or more complex things than an alternative explanation would require.
Ontology(Carnap argues this enterprise is based on a mistake): The philosophical discipline that tries to answer hard questions about what there really is.
Recursive satisfaction clauses(as Tarski's technical approach): A mathematical method that builds up complex truths from simpler pieces, like explaining how a big sentence is true by breaking it into smaller parts and checking if each part is true.
Tarski: Alfred Tarski was a Polish-American logician and mathematician (1901-1983) who made groundbreaking discoveries about how language, logic, and truth work together. He's most famous for developing a mathematical theory of truth that explains how words and sentences relate to the real world—essentially answering the question "what does it mean for something to be true?" His ideas are fundamental to modern logic, computer science, and philosophy because they provided precise tools for understanding language and reasoning.

Based on where you are in your exploration