"A simple proof that connectivity of finite graphs is not first-order ..."

Haim Gaifman, Moshe Y. Vardi (1985)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-06-18

- no documents available
- export record
  dblp key:
  - journals/eatcs/GaifmanV85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/GaifmanV85
Haim Gaifman, Moshe Y. Vardi:
A simple proof that connectivity of finite graphs is not first-order definable. Bull. EATCS 26: 43-44 (1985)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.