Equivariant ZFA with Choice: a position paper

03/23/2018
by   Murdoch J. Gabbay, et al.
0

We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.

READ FULL TEXT

page 1

page 2

research
08/01/2021

Choice number of Kneser graphs

In this short note, we show that for any ϵ >0 and k<n^0.5-ϵ the choice n...
research
03/08/2016

Pairwise Choice Markov Chains

As datasets capturing human choices grow in richness and scale---particu...
research
02/07/2023

Choice-free Topological Duality for Implicative Lattices and Heyting Algebras

We develop a common semantic framework for the interpretation both of 𝐈𝐏...
research
01/10/2013

A Paraconsistent Tableau Algorithm Based on Sign Transformation in Semantic Web

In an open, constantly changing and collaborative environment like the f...
research
06/07/2022

An extension to the applicability of adaptive bandwidth choice

In this paper, we extend the applicability of the bandwidth choice metho...
research
08/02/2021

Escaping Arrow's Theorem: The Advantage-Standard Model

There is an extensive literature in social choice theory studying the co...
research
05/17/2023

Reprompting: Automated Chain-of-Thought Prompt Inference Through Gibbs Sampling

We introduce Reprompting, an iterative sampling algorithm that searches ...

Please sign up or login with your details

Forgot password? Click here to reset